id:A076466 - OEIS Search Results

Search: id:A076466

Displaying 1-1 of 1 results found.

page 1

a(1)=1 a(n) = a(n-1) + ((-1)^a(n-1)*a(n-1)) mod n.

+0
1

1, 2, 4, 4, 8, 10, 13, 16, 23, 30, 38, 40, 41, 42, 54, 60, 69, 72, 87, 100, 116, 122, 129, 144, 163, 182, 202, 208, 213, 240, 263, 288, 312, 318, 321, 324, 352, 362, 373, 400, 431, 462, 494, 504, 513, 552, 587, 624, 660, 670, 677, 728, 767, 810, 850, 860, 865 (list; graph; listen)

	OFFSET	`1,2`
	FORMULA	`a(n) is asymptotic to 4n^2/15; a(n)=4n^2/15 if n is of the form 30(2k+1) hence a(60k+30) = 1800(2k+1)^2`
	EXAMPLE	`a(8) = a(7) + ( (-1)^a(7)*a(7)) mod 8 = 13 + (- 13) mod 8 = 13 + 3 = 16`
	PROGRAM	`(PARI) a(n)=a(n-1)+((-1)^a(n-1)*a(n-1))%n`
	CROSSREFS	`Sequence in context: A048656 A107848 A029599 this_sequence A073117 A039879 A125204` `Adjacent sequences: A076463 A076464 A076465 this_sequence A076467 A076468 A076469`
	KEYWORD	`nonn`
	AUTHOR	`Benoit Cloitre (benoit7848c(AT)orange.fr), Nov 07 2002`

page 1

Search completed in 0.002 seconds

Last modified November 25 20:09 EST 2009. Contains 167514 sequences.

AT&T Labs Research