|
| |
|
|
A071797
|
|
Restart counting after each new odd integer (a fractal sequence).
|
|
13
| |
|
|
1, 1, 2, 3, 1, 2, 3, 4, 5, 1, 2, 3, 4, 5, 6, 7, 1, 2, 3, 4, 5, 6, 7, 8, 9, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,3
|
|
|
COMMENTS
| The following sequences all have the same parity: A004737, A006590, A027052, A071028, A071797, A078358, A078446.
|
|
|
REFERENCES
| C. Kimberling : "Numeration systems and fractal sequences", Acta Arithmetica 73 (1995) 103-117.
|
|
|
LINKS
| F. Smarandache, Only Problems, Not Solutions!, Phoenix,AZ: Xiquan,1993.
M. Somos, Sequences used for indexing triangular or square arrays
|
|
|
FORMULA
| a(n) = n-1-ceiling(sqrt(n))*(ceiling(sqrt(n))-2); n>0.
a(n) = n-floor(sqrt(n-1))^2. - Marc LeBrun (mlb(AT)well.com), Jan 14 2004
|
|
|
EXAMPLE
| a(1)=1; a(9)= 5; a(10)=1;
|
|
|
PROG
| (PARI) a(n)=if(n<1, 0, n-sqrtint(n-1)^2)
|
|
|
CROSSREFS
| Cf. A002260. a(n)=1+A053186(n-1).
Sequence in context: A033924 A003315 A194107 * A025481 A124171 A076645
Adjacent sequences: A071794 A071795 A071796 * A071798 A071799 A071800
|
|
|
KEYWORD
| easy,nonn
|
|
|
AUTHOR
| Antonio Esposito (antonio.b.esposito(AT)italtel.it), Jun 06 2002
|
| |
|
|
