[go: up one dir, main page]

login
Revision History for A145215 (Bold, blue-underlined text is an addition; faded, red-underlined text is a deletion.)

Showing all changes.
a(n) is the minimal prime of the form 4k+1 for which s=A008784(n) is the minimal positive integer such that s*a(n)-floor(sqrt(s*a(n)))^2 is a square.
(history; published version)
#9 by Andrey Zabolotskiy at Thu Dec 28 19:39:09 EST 2023
STATUS

editing

approved

#8 by Andrey Zabolotskiy at Thu Dec 28 19:39:07 EST 2023
NAME

a(n) is the minimal prime of the form 4k+1 for which s=A008784(n) is the minimal positive integer such that s*a(n)-(floor(sqrt(s*a(n)))^2 is a square.

STATUS

approved

editing

#7 by Susanna Cuyler at Sun Jan 12 23:46:11 EST 2020
STATUS

proposed

approved

#6 by Jon E. Schoenfield at Sun Jan 12 20:18:00 EST 2020
STATUS

editing

proposed

#5 by Jon E. Schoenfield at Sun Jan 12 20:17:57 EST 2020
NAME

a(n) is the minimal prime of the form 4k+1 for which s=A008784(n) is the minimal positive integer such that s*a(n)-(floor(sqrt(s*a(n)))^2 is a full square.

COMMENTS

See the conjecture in the comment to at A145047. In addition, I conjecture that for every such s there exist infinitely many primes of the form 4k+1.

STATUS

approved

editing

#4 by Charles R Greathouse IV at Thu Feb 07 23:10:06 EST 2013
STATUS

editing

approved

#3 by Charles R Greathouse IV at Thu Feb 07 23:09:56 EST 2013
NAME

a(n) is the minimal prime of the form 4k+1 for which s=A008784(n) is the minimal positive integer such that sas*a(n)-(floor(sqrt(sas*a(n)))^2 is a full square

DATA

5, 41, 353, 1237, 2749, 3037, 10369, 6569, 27253, 38561, 14897, 33289, 27917, 171629, 143513, 76081, 37649, 373273, 399181, 63029, 133157, 657601, 637601, 425197, 94261, 499321, 910853, 229849, 149837

COMMENTS

See the conjecture in comment to A145047. In addition, we I conjecture that for every such s there exist infinitely many primes of the form 4k+1.

PROG

(PARI) f(s)=forprime(p=2, , if(p%4>1 || !issquare(s*p-sqrtint(s*p)^2), next); for(i=1, s-1, if(issquare(i*p-sqrtint(i*p)^2), next(2))); return(p))

S=select(n->if(n%2==0, if(n%4, n/=2, return(0))); n==1||vecmax(factor(n)[, 1]%4)==1, vector(150, i, i));

apply(f, S) \\ Charles R Greathouse IV, Feb 07 2013

EXTENSIONS

a(22) corrected by Charles R Greathouse IV, Feb 07 2013

STATUS

approved

editing

#2 by Russ Cox at Fri Mar 30 18:52:52 EDT 2012
AUTHOR

_Vladimir Shevelev (shevelev(AT)bgu.ac.il), _, Oct 05 2008

Discussion
Fri Mar 30
18:52
OEIS Server: https://oeis.org/edit/global/261
#1 by N. J. A. Sloane at Fri Jan 09 03:00:00 EST 2009
NAME

a(n) is the minimal prime of the form 4k+1 for which s=A008784(n) is the minimal positive integer such that sa(n)-(floor(sqrt(sa(n)))^2 is a full square

DATA

5, 41, 353, 1237, 2749, 3037, 10369, 6569, 27253, 38561, 14897, 33289, 27917, 171629, 143513, 76081, 37649, 373273, 399181, 63029, 133157, 657601, 425197, 94261, 499321, 910853, 229849, 149837

OFFSET

1,1

COMMENTS

See the conjecture in comment to A145047. In addition, we conjecture that for every such s there exist infinitely many primes of the form 4k+1.

KEYWORD

nonn

AUTHOR

Vladimir Shevelev (shevelev(AT)bgu.ac.il), Oct 05 2008

STATUS

approved