Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A159477
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A159477 a(n) = smallest primes >= n, if 1 is counted as a prime. +0
1
1, 2, 3, 5, 5, 7, 7, 11, 11, 11, 11, 13, 13, 17, 17, 17, 17, 19, 19, 23, 23, 23, 23, 29, 29, 29, 29, 29, 29, 31, 31, 37, 37, 37, 37, 37, 37, 41, 41, 41, 41, 43, 43, 47, 47, 47, 47, 53, 53, 53, 53, 53, 53, 59, 59, 59, 59 (list; graph; listen)
OFFSET

1,2

FORMULA

For n >= 2, a(n) = A007918(n). a(p) = p, a(c) = a(c+1), for p = primes (A000040), c = composite numbers (A002808).

CROSSREFS

Cf.: A007918, A000040, A002808.

Sequence in context: A126762 A082048 A113459 this_sequence A123318 A111060 A082432

Adjacent sequences: A159474 A159475 A159476 this_sequence A159478 A159479 A159480

KEYWORD

nonn

AUTHOR

Jaroslav Krizek (jaroslav.krizek(AT)atlas.cz), Apr 13 2009

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 22:38 EST 2009. Contains 167602 sequences.


AT&T Labs Research