Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A096275
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A096275 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)
page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 30 13:13 EST 2009. Contains 167758 sequences.


AT&T Labs Research