Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A127417
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A127417 a(1)=1; for n > 1, a(n) = number of earlier terms a(k), 1<k<=n-1, such that (a(k)+n) is divisible by k. +0
2
1, 1, 2, 2, 2, 2, 3, 2, 2, 4, 3, 1, 4, 3, 2, 5, 2, 4, 4, 1, 2, 6, 4, 1, 6, 3, 3, 5, 2, 4, 3, 4, 3, 6, 4, 2, 3, 5, 5, 4, 3, 3, 7, 2, 2, 7, 4, 3, 5, 3, 4, 5, 6, 3, 3, 4, 2, 6, 6, 4, 6, 4, 5, 3, 3, 5, 5, 3, 3, 7, 6, 2, 6, 5, 4, 5, 2, 5, 8, 1, 5, 6, 5, 1, 6, 7, 3, 9, 2, 4, 5, 2, 5, 6, 6, 5, 5, 4, 4, 6, 4, 4, 6, 3, 4 (list; graph; listen)
page 1

Search completed in 0.001 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 15 00:47 EST 2009. Contains 170825 sequences.


AT&T Labs Research