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!)
A084747 Leading diagonal of triangle shown below in which the n-th row contains the n smallest numbers > 0 such that when they are incremented by n yield a prime. 2
1, 3, 8, 9, 14, 17, 24, 29, 32, 33, 42, 47, 54, 57, 58, 63, 72, 79, 84, 87, 88, 91, 108, 113, 114, 123, 124, 129, 138, 143, 150, 159, 160, 163, 164, 175, 190, 191, 194, 199, 210, 215, 226, 227, 232, 235, 246, 259, 262, 263, 266, 279, 294, 295, 298, 303, 310, 315 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
LINKS
FORMULA
a(n) = A084695(n, n).
a(n) = prime(primepi(n) + n) - n. - Richard R. Forberg, Mar 22 2021
EXAMPLE
Triangle of A084695(n,k) begins:
1;
1, 3;
2, 4, 8;
1, 3, 7, 9;
2, 6, 8, 12, 14;
1, 5, 7, 11, 13, 17;
4, 6, 10, 12, 16, 22, 24;
...
so sequence is 1, 3, 8, 9, 14, 17, 24, ... = A084695(n, n).
MATHEMATICA
Table[Prime[PrimePi[n] +n] -n, {n, 80}] (* G. C. Greubel, May 12 2023 *)
PROG
(PARI) a(n) = prime(primepi(n) + n) - n; \\ Michel Marcus, Mar 28 2021
(Magma) [NthPrime(#PrimesUpTo(n) +n) -n: n in [1..80]]; // G. C. Greubel, May 12 2023
(SageMath)
def A084747(n): return nth_prime(prime_pi(n) + n) - n
[A084747(n) for n in range(1, 81)] # G. C. Greubel, May 12 2023
CROSSREFS
For triangle see A084695.
Cf. A000040 (prime), A000720 (primepi).
Sequence in context: A239388 A259850 A071677 * A286177 A287579 A289142
KEYWORD
easy,nonn
AUTHOR
Amarnath Murthy and Jason Earls, Jul 12 2003
STATUS
approved

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 March 28 14:38 EDT 2024. Contains 371254 sequences. (Running on oeis4.)