login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A100486 a(n) = pi(n) + prime(n). 4

%I #30 Apr 05 2023 09:47:20

%S 2,4,7,9,14,16,21,23,27,33,36,42,47,49,53,59,66,68,75,79,81,87,92,98,

%T 106,110,112,116,119,123,138,142,148,150,160,162,169,175,179,185,192,

%U 194,205,207,211,213,226,238,242,244,248,254,257,267,273,279,285,287

%N a(n) = pi(n) + prime(n).

%H Indranil Ghosh, <a href="/A100486/b100486.txt">Table of n, a(n) for n = 1..10410</a>

%F a(n) = A000720(n) + A000040(n). - _Wesley Ivan Hurt_, Jan 28 2014

%e a(21) = pi(21) + prime(21) = 8 + 73 = 81.

%p with(numtheory); A100486:=n->pi(n) + ithprime(n); seq(A100486(n), n=1..60); # _Wesley Ivan Hurt_, Jan 28 2014

%t Table[PrimePi[n] + Prime[n], {n, 60}]

%o (PARI) a(n) = primepi(n) + prime(n); \\ _Michel Marcus_, Feb 24 2023

%o (Magma) [#PrimesUpTo(n) + NthPrime(n): n in [1..80]]; // _G. C. Greubel_, Apr 04 2023

%o (SageMath) [prime_pi(n) + nth_prime(n) for n in range(1,81)] # _G. C. Greubel_, Apr 04 2023

%Y Cf. A000040, A000720, A065042, A100917.

%K easy,nonn

%O 1,1

%A _Jonathan Vos Post_, Nov 22 2004

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 2 00:19 EDT 2024. Contains 375599 sequences. (Running on oeis4.)