|
| |
|
|
A073189
|
|
Integers 0..n three times then 0..n+1 three times etc.
|
|
16
|
|
|
|
0, 0, 0, 0, 1, 0, 1, 0, 1, 0, 1, 2, 0, 1, 2, 0, 1, 2, 0, 1, 2, 3, 0, 1, 2, 3, 0, 1, 2, 3, 0, 1, 2, 3, 4, 0, 1, 2, 3, 4, 0, 1, 2, 3, 4, 0, 1, 2, 3, 4, 5, 0, 1, 2, 3, 4, 5, 0, 1, 2, 3, 4, 5, 0, 1, 2, 3, 4, 5, 6, 0, 1, 2, 3, 4, 5, 6, 0, 1, 2, 3, 4, 5, 6, 0, 1, 2, 3, 4, 5, 6, 7, 0, 1, 2, 3, 4, 5, 6, 7, 0, 1, 2, 3, 4
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
|
OFFSET
|
0,12
|
|
|
LINKS
|
Table of n, a(n) for n=0..104.
M. Somos, Sequences used for indexing triangular or square arrays
|
|
|
EXAMPLE
|
0; 0; 0; 0,1; 0,1; 0,1; 0,1,2; 0,1,2; 0,1,2; 0,1,2,3; 0,1,2,3; ...
|
|
|
MATHEMATICA
|
Table[Range[0, k], {k, 0, 7}, {3}] // Flatten (* Jean-François Alcover, Apr 18 2013 *)
|
|
|
PROG
|
(PARI) a(n)=local(m); m=floor(sqrt(6*n+6)-3/2)\3+1; (n-3*binomial(m, 2))%m
|
|
|
CROSSREFS
|
Sequence in context: A215592 A025684 A025678 * A194519 A025855 A215590
Adjacent sequences: A073186 A073187 A073188 * A073190 A073191 A073192
|
|
|
KEYWORD
|
nonn
|
|
|
AUTHOR
|
Michael Somos, Jul 19 2002
|
|
|
STATUS
|
approved
|
| |
|
|
