|
Search: id:A088564
|
|
|
| A088564 |
|
a(n)=sum(i=0,n,binomial(2*i,i) (mod 3)). |
|
+0
1
|
|
| 1, 3, 3, 5, 6, 6, 6, 6, 6, 8, 9, 9, 10, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 14, 15, 15, 16, 18, 18, 18, 18, 18, 19, 21, 21, 23, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
COMMENT
|
Distinct values (i.e. 1,3,5,6,8,9,...) are given by the partial sums of the Thue-Morse sequence on alphabet (1,2) A026430. Sequence of least k such that a(k)>a(k-1) is given by A005836. For any k>=0, card{ n : a(3*A005836(k)) =a(n)}=1.
|
|
CROSSREFS
|
Cf. A001285, A005836, A006996.
Sequence in context: A128444 A131948 A134636 this_sequence A161560 A078796 A079789
Adjacent sequences: A088561 A088562 A088563 this_sequence A088565 A088566 A088567
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
[Author's name was accidentally deleted], Nov 19, 2003
|
|
EXTENSIONS
|
Author was Michael Somos or Benoit Cloitre, I think. Apologies! - N. J. A. Sloane (njas(AT)research.att.com), Jun 13 2004.
|
|
|
Search completed in 0.002 seconds
|
