login
This site is supported by donations to The OEIS Foundation.

 

Logo

Invitation: celebrating 50 years of OEIS, 250000 sequences, and Sloane's 75th, there will be a conference at DIMACS, Rutgers, Oct 9-10 2014.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A064427 (Number of primes <= n - 1) + n. 3
1, 2, 4, 6, 7, 9, 10, 12, 13, 14, 15, 17, 18, 20, 21, 22, 23, 25, 26, 28, 29, 30, 31, 33, 34, 35, 36, 37, 38, 40, 41, 43, 44, 45, 46, 47, 48, 50, 51, 52, 53, 55, 56, 58, 59, 60, 61, 63, 64, 65, 66, 67, 68, 70, 71, 72, 73, 74, 75, 77 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

COMMENTS

Complement of set {A(prime(n)+n)} = {A014688(n)} = {A(A000040(n)+A000027(n))}. [From Jaroslav Krizek, Dec 10 2009]

a(n) = numbers m such that are not the sum of k-th prime and k for any k >= 1. [From Jaroslav Krizek, Dec 10 2009]

LINKS

Reinhard Zumkeller, Table of n, a(n) for n = 1..10000

Eric Weisstein's World of Mathematics, Prime Counting Function

Wikipedia, Prime-counting function

FORMULA

For n > 1: a(n) = A000720(n - 1) + n.

MATHEMATICA

a[n_] := PrimePi[a[n-1]]+n; a[1]=1

PROG

(Haskell)

a064427 1 = 1

a064427 n = a000720 (n - 1) + toInteger n

-- Reinhard Zumkeller, Apr 17 2012

CROSSREFS

Cf. A095117.

Sequence in context: A026516 A186493 A111094 * A183569 A213356 A079393

Adjacent sequences:  A064424 A064425 A064426 * A064428 A064429 A064430

KEYWORD

nonn

AUTHOR

Santi Spadaro, Sep 30 2001

EXTENSIONS

Definition improved by Reinhard Zumkeller, Apr 16 2012

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified July 25 20:53 EDT 2014. Contains 244919 sequences.