|
Search: id:A101403
|
|
| |
|
| 1, 3, 2, 4, 3, 2, 3, 3, 2, 4, 3, 2, 2, 3, 2, 4, 3, 2, 3, 3, 2, 4, 3, 3, 3, 2, 4, 3, 2, 3, 3, 2, 4, 3, 2, 2, 3, 2, 4, 3, 2, 3, 3, 2, 4, 3, 2, 3, 2, 4, 3, 2, 3, 3, 2, 4, 3, 2, 2, 3, 2, 4, 3, 2, 3, 3, 2, 4, 3, 3, 3, 2, 4, 3, 2, 3, 3, 2, 4, 3, 2, 2, 3, 2, 4, 3, 2, 3, 3, 2, 4, 4, 3, 2, 4, 3, 2, 3, 3
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
MATHEMATICA
|
Mathematica code from Keith Schneider, May 25 2007:
A101402[0] = 0; A101402[1] = 1;
A101402[n_] := A101402[n] = A101402[2^(Floor[Log[2, n - 1]])] + A101402[n - 1 - 2^(Floor[Log[2, n - 1]])]; TheList = Table[A101402[i], {i, 0, 279}];
A101403 = Table[Count[TheList, i], {i, 0, Last[TheList]}]
|
|
CROSSREFS
|
Sequence in context: A016559 A104566 A143156 this_sequence A025509 A130079 A134559
Adjacent sequences: A101400 A101401 A101402 this_sequence A101404 A101405 A101406
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Odimar Fabeny (aifab(AT)yahoo.com.br), Jan 16 2005
|
|
EXTENSIONS
|
More terms from Keith Schneider, May 25 2007
|
|
|
Search completed in 0.002 seconds
|
