|
Search: id:A084316
|
|
|
| A084316 |
|
a(n) is the smallest number x such that GCD[p(x)+1,x+1]=n, where p(j) is the j*th prime. |
|
+0
8
|
|
| 1, 3, 20, 11, 24, 5, 6, 39, 98, 29, 120, 23, 64, 13, 104, 15, 1716, 323, 284, 499, 62, 1099, 1264, 215, 1274, 51, 512, 447, 1768, 209, 1332, 31, 32, 373, 34, 1475, 258, 835, 2300, 519, 5780, 419, 5374, 1275, 6974, 1655, 6626, 479, 10240, 10549, 3008, 883, 13938
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
FORMULA
|
a(n)=Min{x; A066752(x)=n}
|
|
EXAMPLE
|
In A066752, n=5 arises first at the 24th position, so
A084316[5]=a(5)=24.
|
|
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-A084315.
Sequence in context: A067607 A013332 A063871 this_sequence A126810 A115280 A081849
Adjacent sequences: A084313 A084314 A084315 this_sequence A084317 A084318 A084319
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Labos E. (labos(AT)ana.sote.hu), Jun 13 2003
|
|
|
Search completed in 0.002 seconds
|
