The On-Line Encyclopedia of Integer Sequences (OEIS)

Revision History for A337376

(Bold, blue-underlined text is an addition; faded, red-underlined text is a ~~deletion~~.)
Showing entries 1-10 | older changes

A337376

Primorial deflation (numerator) of Doudna-tree.
(history; published version)

#32 by Susanna Cuyler at Thu Jul 08 14:22:03 EDT 2021

STATUS

proposed

approved

#31 by Antti Karttunen at Wed Jul 07 17:14:05 EDT 2021

STATUS

editing

proposed

#30 by Antti Karttunen at Wed Jul 07 13:08:50 EDT 2021

CROSSREFS

Cf. also A329886, A346096.

#29 by Antti Karttunen at Wed Jul 07 12:24:44 EDT 2021

KEYWORD

nonn,frac,tabf,look,changed

#28 by Antti Karttunen at Wed Jul 07 12:23:28 EDT 2021

LINKS

Antti Karttunen, <a href="/indexA337376/Fo#fraction_treesb337376.txt">Index entries Table of n, a(n) for fraction treesn = 0..8191</a>

<a href="/index/Fo#fraction_trees">Index entries for fraction trees</a>

CROSSREFS

Cf. also A329886.

#27 by Antti Karttunen at Wed Jul 07 12:20:38 EDT 2021

LINKS

Antti Karttunen, <a href="/A337376/a337376.txt">Data supplement: n, a(n) computed for n = 0..65537</a>

STATUS

approved

editing

#26 by N. J. A. Sloane at Tue Oct 06 02:36:16 EDT 2020

STATUS

proposed

approved

#25 by Wesley Ivan Hurt at Tue Oct 06 00:05:09 EDT 2020

STATUS

editing

proposed

#24 by Wesley Ivan Hurt at Tue Oct 06 00:05:03 EDT 2020

FORMULA

a(2n2*n) = A003961(a(n)).

If A007814(n+1) < A337821(n+1) then a(2n2*n+1) = a(n), otherwise a(2n2*n+1) = 2 * a(n).

If A337377(n) mod 2 = 0 then a(2n2*n+1) = a(n), otherwise a(2n2*n+1) = 2 * a(n).

A000265(a(2n2*n+1)) = A000265(a(n)).

A001222(a(2n2*n)) = A001222(A337377(2n2*n)) = A001222(a(n)).

A001222(a(2n2*n+1)) - A001222(A337377(2n2*n+1)) = 1 + A001222(a(n)) - A001222(A337377(n)).

STATUS

proposed

editing

#23 by Antti Karttunen at Mon Oct 05 13:32:14 EDT 2020

STATUS

editing

proposed