id:A071797 - OEIS Search Results

Search: id:A071797

Displaying 1-1 of 1 results found.

page 1

Restart counting after each new odd integer (a fractal sequence).

+0
9

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; listen)

	OFFSET	`1,3`
	COMMENT	`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;`
	PROGRAM	`(PARI) a(n)=if(n<1, 0, n-sqrtint(n-1)^2)`
	CROSSREFS	`Cf. A002260. a(n)=1+A053186(n-1).` `Sequence in context: A053737 A033924 A003315 this_sequence A025481 A124171 A076645` `Adjacent sequences: A071794 A071795 A071796 this_sequence A071798 A071799 A071800`
	KEYWORD	`easy,nonn`
	AUTHOR	`Antonio Esposito (antonio.b.esposito(AT)italtel.it), Jun 06 2002`

page 1

Search completed in 0.002 seconds

Last modified December 2 11:54 EST 2009. Contains 167921 sequences.

AT&T Labs Research