id:A096275 - OEIS Search Results

Search: id:A096275

Displaying 1-1 of 1 results found.

page 1

a(0) = 0, a(1) = 1; a(n) = (a(n-1) + a(n-2)) mod n^2.

+0
1

0, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 0, 89, 89, 178, 11, 189, 200, 28, 228, 256, 0, 256, 256, 512, 92, 604, 696, 459, 255, 714, 969, 594, 407, 1001, 112, 1113, 1225, 817, 442, 1259, 1701, 1111, 876, 1987, 747, 525, 1272, 1797, 569, 2366, 231, 2597, 2828, 2400, 2092 (list; graph; listen)

	OFFSET	`0,3`
	MATHEMATICA	`a = 0; b = 1; i = 2; Do[c = Mod[a + b, i^2]; If[c == 0, Print[i]]; a = b; b = c; i++, {1000000}]`
	CROSSREFS	`Cf. A096535.` `Adjacent sequences: A096272 A096273 A096274 this_sequence A096276 A096277 A096278` `Sequence in context: A023440 A077373 A132634 this_sequence A093089 A093091 A105471`
	KEYWORD	`easy,nonn`
	AUTHOR	`N. Fernandez (primeness(AT)borve.org), Jun 23 2004`

page 1

Search completed in 0.002 seconds

Last modified November 8 07:45 EST 2009. Contains 166143 sequences.

AT&T Labs Research