|
| |
|
|
A055087
|
|
Integers 0..n then 0..n then 0..n+1 then 0..n+1 etc.
|
|
3
| |
|
|
0, 0, 0, 1, 0, 1, 0, 1, 2, 0, 1, 2, 0, 1, 2, 3, 0, 1, 2, 3, 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, 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, 5, 6, 7, 8, 0, 1, 2, 3, 4, 5, 6, 7, 8, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 0, 1
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 0,9
|
|
|
COMMENTS
| Second column in the monotonic justified array of all positive generalized Fibonacci sequences (A160271). see also A199474. - Casey Mongoven, Nov 06 2011
|
|
|
LINKS
| M. Somos, Sequences used for indexing triangular or square arrays
|
|
|
EXAMPLE
| 0, 0, 0,1, 0,1, 0,1,2, 0,1,2, 0,1,2,3, 0,1,2,3, ...
|
|
|
PROG
| (PARI) a(n)=(1+4*n-sqr(floor(sqrt(1+4*n))))\4
|
|
|
CROSSREFS
| Sequence in context: A096771 A129714 A022333 * A025685 A194515 A163325
Adjacent sequences: A055084 A055085 A055086 * A055088 A055089 A055090
|
|
|
KEYWORD
| nonn,easy
|
|
|
AUTHOR
| Michael Somos
|
| |
|
|
