Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A125727
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A125727 a(1)=1. a(2)=2. a(n) = the smallest positive integer not occurring earlier in the sequence such that a(n-2)+a(n-1) is congruent to a(n) (mod n). +0
2
1, 2, 3, 5, 8, 7, 15, 6, 12, 18, 19, 13, 32, 17, 4, 21, 25, 10, 16, 26, 42, 24, 20, 44, 14, 58, 45, 47, 34, 51, 23, 74, 31, 37, 33, 70, 29, 61, 90, 71, 38, 67, 62, 41, 103, 52, 108, 64, 123, 87, 57, 40, 97, 83, 125, 96, 50, 30, 80, 110, 68, 54, 59, 49, 43, 92, 135, 91, 88, 39 (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 December 6 13:45 EST 2009. Contains 170429 sequences.


AT&T Labs Research