|
| |
|
|
A084315
|
|
a(n)=x is the smallest number such that GCD[p(x)-1,x-1]=n, where p(j) is the j*th prime.
|
|
2
| |
|
|
1, 3, 4, 13, 36, 19, 120, 33, 46, 11, 78, 37, 560, 239, 496, 1905, 52, 397, 3250, 221, 778, 573, 2738, 25, 26, 287, 352, 477, 552, 271, 8588, 449, 5710, 205, 456, 145, 1000, 4067, 2536, 761, 14638, 295, 4344, 2685, 406, 1151, 612, 3121, 6616, 551, 868, 469, 20088
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,2
|
|
|
FORMULA
| a(n)=Min{x; A084311(x)=n}
|
|
|
EXAMPLE
| In A084311, n=4 arises first at the 13rd position, so
A084315[4]=a(4)=13.
|
|
|
MATHEMATICA
| f[x_] := GCD[Prime[x]-1, x-1] 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: A192872 A036672 A174684 * A194649 A062165 A201821
Adjacent sequences: A084312 A084313 A084314 * A084316 A084317 A084318
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| Labos E. (labos(AT)ana.sote.hu), Jun 13 2003
|
| |
|
|
