|
Search: id:A008810
|
|
| |
|
| 0, 1, 2, 3, 6, 9, 12, 17, 22, 27, 34, 41, 48, 57, 66, 75, 86, 97, 108, 121, 134, 147, 162, 177, 192, 209, 226, 243, 262, 281, 300, 321, 342, 363, 386, 409, 432, 457, 482, 507, 534, 561, 588, 617, 646, 675, 706, 737, 768, 801, 834, 867, 902, 937, 972, 1009, 1046
(list; graph; listen)
|
|
|
OFFSET
|
0,3
|
|
|
REFERENCES
|
J. H. Conway and R. K. Guy, The Book of Numbers, Copernicus Press, NY, 1996, number of red blocks in Fig 2.5.
|
|
LINKS
|
S. Lafortune, A. Ramani, B. Grammaticos, Y. Ohta and K.M. Tamizhmani, Blending two discrete integrability criteria: ...
|
|
FORMULA
|
Euler transform of length 6 sequence [ 2, 0, 2, 0, 0, -1]. - Michael Somos Aug 03 2006
a(-n)=a(n)=ceiling(n^2/3).
G.f.: x*(1+x^3)/((1-x)^2*(1-x^3)) = x*(1-x^6)/((1-x)*(1-x^3))^2.
|
|
PROGRAM
|
(PARI) a(n)=ceil(n^2/3) /* Michael Somos Aug 03 2006 */
|
|
CROSSREFS
|
A056105(n)=a(3n-1). A056109(n)=a(3n+1). - Michael Somos Aug 03 2006.
Sequence in context: A057474 A077121 A140495 this_sequence A058616 A123316 A096845
Adjacent sequences: A008807 A008808 A008809 this_sequence A008811 A008812 A008813
|
|
KEYWORD
|
nonn,easy,nice
|
|
AUTHOR
|
njas
|
|
|
Search completed in 0.002 seconds
|
