Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A096534
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A096534 a(1) = 0; a(2) = 1; a(n) = (a(n-1) + a(n-2)) mod n. +0
3
0, 1, 1, 2, 3, 5, 1, 6, 7, 3, 10, 1, 11, 12, 8, 4, 12, 16, 9, 5, 14, 19, 10, 5, 15, 20, 8, 0, 8, 8, 16, 24, 7, 31, 3, 34, 0, 34, 34, 28, 21, 7, 28, 35, 18, 7, 25, 32, 8, 40, 48, 36, 31, 13, 44, 1, 45, 46, 32, 18, 50, 6, 56, 62, 53, 49, 35, 16, 51, 67, 47, 42, 16, 58, 74, 56, 53, 31, 5, 36 (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 27 14:50 EST 2009. Contains 167570 sequences.


AT&T Labs Research