Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A101505
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A101505 Smallest m such that A101504(m) = n. +0
2
0, 2, 3, 4, 6, 7, 10, 11, 15, 20, 25, 26, 32, 33, 40, 49, 57, 58, 67, 68, 78, 91, 102, 103, 115, 132, 145, 162, 176, 177, 192, 193, 209, 230, 247, 272, 290, 291, 310, 335, 355, 356, 377, 378, 400, 429, 452, 453, 477, 514, 539, 572, 598, 599, 626, 667, 695, 732 (list; graph; listen)
OFFSET

1,2

COMMENT

a(p+1) = a(p) + 1 for primes p.

FORMULA

a(n+1) = a(n) + n + 2 - A101504(a(n)+1), a(1) = 1.

CROSSREFS

Adjacent sequences: A101502 A101503 A101504 this_sequence A101506 A101507 A101508

Sequence in context: A055802 A114220 A134519 this_sequence A068713 A099523 A049806

KEYWORD

nonn

AUTHOR

Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Dec 05 2004

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 October 13 09:05 EDT 2008. Contains 145008 sequences.


AT&T Labs Research