|
| |
|
|
A033042
|
|
Numbers whose set of base 5 digits is {0,1}.
|
|
29
| |
|
|
0, 1, 5, 6, 25, 26, 30, 31, 125, 126, 130, 131, 150, 151, 155, 156, 625, 626, 630, 631, 650, 651, 655, 656, 750, 751, 755, 756, 775, 776, 780, 781, 3125, 3126, 3130, 3131, 3150, 3151, 3155, 3156, 3250, 3251, 3255, 3256, 3275, 3276, 3280, 3281, 3750, 3751
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 0,3
|
|
|
COMMENTS
| Sums of distinct powers of 5.
a(n) modulo 2 is the Prouhet-Thue-Morse sequence A010060.- From DELEHAM Philippe, Oct 17 2011.
|
|
|
LINKS
| T. D. Noe, Table of n, a(n) for n=0..1023
David Applegate, Omar E. Pol and N. J. A. Sloane, The Toothpick Sequence and Other Sequences from Cellular Automata
N. J. A. Sloane, Catalog of Toothpick and Cellular Automata Sequences in the OEIS
|
|
|
FORMULA
| a(n)=Sum{d(i)*5^i: i=0, 1, ..., m}, where Sum{d(i)*2^i: i=0, 1, ..., m} is the base 2 representation of n.
n such that the coefficient of x^n is > 0 in prod (k>=0, 1+x^(5^k)) - Benoit Cloitre (benoit7848c(AT)orange.fr), Jul 29 2003
a(n) = A097251(n)/4.
a(2n) = 5*a(n), a(2n+1) = a(2n)+1.
a(n)=Sum_k>=0 {A030308(n,k)*5^k}. - From DELEHAM Philippe, Oct 17 2011.
|
|
|
CROSSREFS
| For generating functions Prod_{k>=0} (1+a*x^(b^k)) for the following values of (a,b) see: (1,2) A000012 and A000027, (1,3) A039966 and A005836, (1,4) A151666 and A000695, (1,5) A151667 and A033042, (2,2) A001316, (2,3) A151668, (2,4) A151669, (2,5) A151670, (3,2) A048883, (3,3) A117940, (3,4) A151665, (3,5) A151671, (4,2) A102376, (4,3) A151672, (4,4) A151673, (4,5) A151674.
Cf. A000695, A005836, A033043-A033052.
Row 5 of array A104257.
Sequence in context: A166591 A160529 A039572 * A039594 A137080 A025622
Adjacent sequences: A033039 A033040 A033041 * A033043 A033044 A033045
|
|
|
KEYWORD
| nonn,base
|
|
|
AUTHOR
| Clark Kimberling (ck6(AT)evansville.edu)
|
|
|
EXTENSIONS
| Extended by Ray Chandler (rayjchandler(AT)sbcglobal.net), Aug 3 2004
|
| |
|
|
