login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A096275 a(0) = 0, a(1) = 1; a(n) = (a(n-1) + a(n-2)) mod n^2. 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; refs; listen; history; text; internal format)
OFFSET
0,3
LINKS
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.
Sequence in context: A077373 A202278 A132634 * A093089 A232666 A093091
KEYWORD
easy,nonn
AUTHOR
Neil Fernandez, Jun 23 2004
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 28 07:48 EDT 2024. Contains 371235 sequences. (Running on oeis4.)