login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A208295
a(n)*(a(n)+1) + A002973(n)^2 = A005098(n), n>=1.
2
0, 1, 0, 2, 0, 2, 3, 2, 1, 2, 4, 0, 1, 3, 5, 3, 5, 6, 4, 3, 0, 7, 6, 7, 0, 6, 4, 2, 8, 6, 5, 4, 2, 8, 3, 8, 9, 0, 1, 7, 8, 3, 10, 9, 2, 5, 10, 9, 6, 0, 11, 2, 8, 9, 12, 6, 12, 11, 0, 2, 7, 13, 4, 9, 12
OFFSET
1,4
COMMENTS
See the Jon Perry comment on A005098. The (even) promic number a(n)*(a(n)+1) (see A002378) when subtracted from A005098(n) (the n-th value k such that 4*k+1 is prime) leaves a square, namely A002973(n)^2. E.g., n=4: 7 - 2*3 = 1^1. n=5: 9 - 0 = 3^2.
2*a(n)+1 = A002972(n), n>=1. E.g., n=4: 2*2+1=5.
FORMULA
a(n) = (sqrt(4*(k(n) - m(n)^2)+1)-1)/2, n>=1, with k(n) := A005098(n) (4*k(n)+1 is the prime A002144(n)) and m(n):= A002973(n).
a(n) = (A002972(n)-1)/2, n>=1.
CROSSREFS
KEYWORD
nonn
AUTHOR
Wolfdieter Lang, Mar 01 2012
STATUS
approved