|
Search: id:A073326
|
|
|
| A073326 |
|
Smallest x such that p(x) == n mod (x-PrimePi(x)-1). |
|
+0
3
|
|
| 6, 67, 9, 10, 13, 96, 15, 16, 74, 73, 32, 85, 31, 4086, 228, 611, 28, 30, 44, 616, 263, 617, 43, 4090, 47, 633, 241, 631, 49
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
a(30) > 40000000, continuing 48, 102, 123, 622, 62, 120, 65, 103, 112, 108, 64, 4094, 63, 127, 271, 109, 128, 129, 70, 132, 133, 137, 131, 4060, 644, 4130, 1608, 642, 138
|
|
FORMULA
|
a(n)=Min{x; Mod[A000040(x), x-A000720(x)-1]=n}
|
|
EXAMPLE
|
Mod[p(10),10-Pi(10)-1]=Mod[29,10-4-1]=Mod[29,5]=4, and a(4)=10.
|
|
MATHEMATICA
|
f[n_] := (k = 4; While[ Mod[ Prime[k], k - PrimePi[k] - 1] != n, k++ ]; k); Table[ f[n], {n, 1, 29}]
|
|
CROSSREFS
|
Cf. A000040, A000720, A073324, A073326.
Sequence in context: A063039 A082781 A099147 this_sequence A024203 A073562 A121958
Adjacent sequences: A073323 A073324 A073325 this_sequence A073327 A073328 A073329
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Labos E. (labos(AT)ana.sote.hu), Jul 30 2002
|
|
EXTENSIONS
|
Edited by Robert G. Wilson v (rgwv(AT)rgwv.com), Jul 31 2002
|
|
|
Search completed in 0.002 seconds
|
