Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A084313
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A084313 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, 21, 16, 5, 6, 315, 24, 63, 20, 121, 12, 65, 14, 105, 320, 697, 306, 2185, 60, 399, 286, 299, 216, 575, 156, 513, 644, 1189, 210, 837, 384, 231, 374, 1505, 684, 3515, 1026, 1131, 1480, 2747, 966, 1591, 1012, 1935, 782, 1645, 1776, 30429, 7600, 3009 (list; graph; listen)
OFFSET

1,2

FORMULA

a(n)=Min{x; A084309(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: A058261 A072397 A077208 this_sequence A074769 A140268 A106422

Adjacent sequences: A084310 A084311 A084312 this_sequence A084314 A084315 A084316

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 December 4 23:11 EST 2009. Contains 170347 sequences.


AT&T Labs Research