The On-Line Encyclopedia of Integer Sequences (OEIS)

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

A151666

Number of partitions of n into distinct powers of 4.
(history; published version)

#26 by Peter Luschny at Sat Aug 07 01:44:45 EDT 2021

STATUS

reviewed

approved

#25 by Joerg Arndt at Sat Aug 07 01:26:22 EDT 2021

STATUS

proposed

reviewed

#24 by Kevin Ryde at Fri Aug 06 20:05:28 EDT 2021

STATUS

editing

proposed

#23 by Kevin Ryde at Fri Aug 06 20:05:04 EDT 2021

CROSSREFS

Cf. A039966, A151667, A000695, A269707.

STATUS

approved

editing

#22 by N. J. A. Sloane at Wed Feb 24 02:48:18 EST 2021

LINKS

David Applegate, Omar E. Pol and N. J. A. Sloane, <a href="http://neilsloane.com/docA000695/tootha000695_1.pdf">The Toothpick Sequence and Other Sequences from Cellular Automata</a>, Congressus Numerantium, Vol. 206 (2010), 157-191. [There is a typo in Theorem 6: (13) should read u(n) = 4.3^(wt(n-1)-1) for n >= 2.]

Discussion

Wed Feb 24

02:48

OEIS Server: https://oeis.org/edit/global/2889

#21 by Alois P. Heinz at Mon Aug 12 16:13:03 EDT 2019

STATUS

proposed

approved

#20 by Ilya Gutkovskiy at Mon Aug 12 12:55:08 EDT 2019

STATUS

editing

proposed

#19 by Ilya Gutkovskiy at Mon Aug 12 12:28:09 EDT 2019

FORMULA

G.f. A(x) satisfies: A(x) = (1 + x) * A(x^4). - Ilya Gutkovskiy, Aug 12 2019

STATUS

approved

editing

#18 by N. J. A. Sloane at Tue Nov 27 18:35:50 EST 2018

LINKS

David Applegate, Omar E. Pol and N. J. A. Sloane, <a href="http://neilsloane.com/doc/tooth.pdf">The Toothpick Sequence and Other Sequences from Cellular Automata</a>, Congressus Numerantium, Vol. 206 (2010), 157-191. [There is a typo in Theorem 6: (13) should read u(n) = 4.3^(wt(n-1)-1) for n >= 2.]

Discussion

Tue Nov 27

18:35

OEIS Server: https://oeis.org/edit/global/2774

#17 by Peter Luschny at Sat Oct 20 10:21:15 EDT 2018

STATUS

reviewed

approved