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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A056895 If the smallest prime with a square excess of n is p then a(n)^2 = p - n. 3
 1, 1, 2, 3, 6, 5, 4, 9, 8, 7, 6, 7, 10, 15, 8, 9, 24, 11, 12, 21, 16, 13, 12, 13, 16, 15, 14, 17, 18, 31, 20, 27, 20, 23, 18, 19, 22, 21, 20, 23, 24, 23, 24, 27, 28, 29, 30, 25, 38, 39, 26, 31, 30, 35, 28, 45, 34, 31, 42, 31, 34, 33, 32, 33, 36, 35, 34, 75, 40, 37, 36, 41, 48, 45 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,3 LINKS Ivan Neretin, Table of n, a(n) for n = 1..10000 FORMULA a(n) = sqrt(A056893(n)-n) = A000196(A056893(n)) = sqrt(A056894(n)). EXAMPLE a(4)=3 because the smallest prime with a square excess of 4 is 13 and 13 - 4 = 3^2. MATHEMATICA a = {}; Do[p = 2; While[n != p - (r = Floor@Sqrt[p])^2, p = NextPrime[p]]; AppendTo[a, r], {n, 74}]; a (* Ivan Neretin, May 02 2019 *) PROG (PARI) a(n) = {my(p=2); while(n != p-sqrtint(p)^2, p = nextprime(p+1)); sqrtint(p - n); } \\ Michel Marcus, May 05 2019 CROSSREFS Cf. A000040, A000196, A002496, A048760, A053186. Cf. A056892, A056893, A056894, A056896, A056897, A056898. Sequence in context: A166166 A106452 A254118 * A254117 A370629 A218890 Adjacent sequences: A056892 A056893 A056894 * A056896 A056897 A056898 KEYWORD nonn AUTHOR Henry Bottomley, Jul 05 2000 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.

Last modified August 6 17:31 EDT 2024. Contains 374981 sequences. (Running on oeis4.)