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”).

A145376
If T(n)>=n is the nearest triangular number to n and p_n is the n-th prime, then a(n) is the least prime such that T(a(n)*p_n)-a(n)p_n is a triangular number
1
3, 2, 2, 2, 2, 3, 5, 5, 7, 11, 11, 11, 13, 17, 17, 19, 23, 23, 23, 29, 29, 29, 31, 37, 37, 41, 41, 41, 41, 43, 53, 53, 53, 59, 59, 61, 67, 67, 67, 71, 73, 73, 79, 79, 83, 83, 89, 97, 97, 97, 97, 101, 101, 107, 107, 113, 113, 127, 127, 127, 127, 127, 131, 137
OFFSET
1,1
COMMENTS
Conjecture. For n>=2 the sequence is nondecreasing.
The conjecture holds for the first 10000 terms. [Charles R Greathouse IV, Feb 21 2011]
LINKS
Charles R Greathouse IV, Table of n, a(n) for n = 1..10000
CROSSREFS
KEYWORD
nonn
AUTHOR
Vladimir Shevelev, Oct 09 2008
EXTENSIONS
a(27)-a(64) from Charles R Greathouse IV, Feb 21 2011
STATUS
approved