Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A034794
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A034794 a(n) is square mod a(n-1) and prime. +0
3
2, 7, 19, 31, 41, 43, 53, 59, 67, 73, 79, 89, 97, 101, 107, 127, 139, 151, 163, 173, 179, 193, 197, 223, 241, 251, 283, 293, 307, 313, 317, 353, 383, 389, 409, 419, 443, 457, 461, 467, 487, 499, 521, 523, 571, 577, 593, 601, 607, 619, 631, 641, 643, 653, 659 (list; graph; listen)
OFFSET

1,1

LINKS

T. D. Noe, Table of n, a(n) for n=1..1000

FORMULA

a(n+1) is the least prime such that a(n) is a quadratic residue of a(n+1). - Gary W. Adamson (qntmpkt(AT)yahoo.com), Feb 29 2004

MATHEMATICA

first Needs[ "NumberTheory`NumberTheoryFunctions`" ] then f[n_] := Block[{k = PrimePi[n] + 1}, While[ JacobiSymbol[n, Prime[k]] == -1, k++ ]; Prime[k]]; NestList[f, 2, 54] (from Robert G. Wilson v Mar 16 2004)

CROSSREFS

Cf. A092581.

Adjacent sequences: A034791 A034792 A034793 this_sequence A034795 A034796 A034797

Sequence in context: A140550 A103034 A038952 this_sequence A038562 A140610 A100119

KEYWORD

nonn,nice

AUTHOR

David W. Wilson (davidwwilson(AT)comcast.net)

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified October 7 14:39 EDT 2008. Contains 144666 sequences.


AT&T Labs Research