[go: up one dir, main page]

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!)
Revision History for A090690 (Underlined text is an addition; strikethrough text is a deletion.)

Showing all changes.
A090690 Repeated primes in first occurrence in the progression kx^2+1.
(history; published version)
#3 by N. J. A. Sloane at Tue Oct 01 17:57:57 EDT 2013
AUTHOR

_Cino Hilliard (hillcino368(AT)gmail.com), _, Dec 18 2003

Discussion
Tue Oct 01 17:57
OEIS Server: https://oeis.org/edit/global/1955
#2 by N. J. A. Sloane at Wed Dec 06 03:00:00 EST 2006
KEYWORD

easy,nonn,new

AUTHOR

Cino Hilliard (hillcino368(AT)hotmailgmail.com), Dec 18 2003

#1 by N. J. A. Sloane at Thu Feb 19 03:00:00 EST 2004
NAME

Repeated primes in first occurrence in the progression kx^2+1.

DATA

13, 29, 37, 53, 61, 73, 97, 101, 109, 127, 137, 149, 157, 173, 181, 193, 197, 229, 257, 269, 277, 293, 317, 337, 349, 373, 389, 397, 421, 457, 461, 487, 509, 541, 557, 569, 577, 613, 617, 641, 653, 661, 673, 677, 701, 709, 733, 757, 773, 797, 809, 811, 821

OFFSET

1,1

COMMENTS

The program lists the repeated occurrences. All but one repeated occurrence were removed manually.

PROG

(PARI) mx2pmp(n, m) = { v=vector(n+1); c=0; for(a=1, n, for(x=1, n, y = a*x^2+1; if(isprime(y), c++; v[c]=y; break); ); ); v1=vecsort(v); for(j=1, n, if(v1[j]<>0 && v1[j]==v1[j+1], print1(v1[j]", "))) }

KEYWORD

easy,nonn

AUTHOR

Cino Hilliard (hillcino368(AT)hotmail.com), Dec 18 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 August 30 11:31 EDT 2024. Contains 375543 sequences. (Running on oeis4.)