Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A084314
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A084314 a(n)=x is the smallest number such that GCD[p(x)+1,x]=n, where p(j) is the j*th prime. +0
1
1, 2, 3, 4, 35, 24, 63, 56, 45, 10, 649, 132, 91, 42, 495, 48, 153, 54, 779, 700, 1785, 264, 851, 96, 1125, 286, 1647, 672, 551, 570, 341, 448, 2277, 1462, 385, 144, 1369, 418, 2145, 1000, 4797, 294, 817, 1804, 405, 414, 7003, 2016, 11515, 950, 2193, 2444 (list; graph; listen)
OFFSET

1,2

FORMULA

a(n)=Min{x; A084310(x)=n}

MATHEMATICA

f[x_] := GCD[Prime[x]+1, x] t=Table[0, {256}]; Do[s=f[n]; If[s<257&&t[[s]]==0, t[[s]]=n], {n, 1, 100000}]; t

CROSSREFS

Cf. A084309-A084316.

Sequence in context: A074920 A102842 A009263 this_sequence A078394 A037326 A024634

Adjacent sequences: A084311 A084312 A084313 this_sequence A084315 A084316 A084317

KEYWORD

nonn

AUTHOR

Labos E. (labos(AT)ana.sote.hu), Jun 13 2003

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 November 23 17:09 EST 2009. Contains 167438 sequences.


AT&T Labs Research