|
Search: id:A100639
|
|
| |
|
| 7, 9, 7, 1, 3, 1, 9, 7, 3, 7, 3, 1, 3, 3, 7, 1, 7, 3, 9, 9, 1, 9, 1, 3, 1, 3, 7, 1, 3, 1, 7, 7, 7, 7, 3, 7, 3, 7, 9, 1, 7, 3, 9, 3, 7, 3, 1, 7, 1, 7, 1, 3, 7, 9, 1, 1, 7, 9, 7, 1, 7, 9, 3, 1, 1, 1, 7, 9, 1, 3, 3, 1, 7, 9, 7, 9, 3, 1, 7, 1, 7, 9, 7, 7, 1, 9, 9, 9, 3, 9, 3, 9, 7, 9, 3, 9, 1, 7, 3, 9, 1, 3, 3, 9, 7
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
REFERENCES
|
Z. I. Borevich and I. R. Shafarevich, Number Theory. Academic Press, NY, 1966, pp. 425-430 (but there are errors).
|
|
EXAMPLE
|
a(6) = 1 because the 6th irregular prime is 131.
|
|
MATHEMATICA
|
fQ[n_] := Block[{p = n, k = 1}, While[ 2*k <= p - 3 && Mod[ Numerator[ BernoulliB[ 2*k ]], p ] != 0, k++ ]; 2k != p - 1]; Mod[ Select[ Prime[ Range[2, 275]], fQ[ # ] &], 10] (from Robert G. Wilson v Dec 10 2004)
|
|
CROSSREFS
|
Cf. A000928.
Sequence in context: A020788 A099877 A019644 this_sequence A108743 A135000 A076668
Adjacent sequences: A100636 A100637 A100638 this_sequence A100640 A100641 A100642
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Pahikkala Jussi (pahio(AT)wakkanet.fi), Dec 04 2004
|
|
EXTENSIONS
|
More terms from Robert G. Wilson v (rgwv(AT)rgwv.com), Dec 10 2004
|
|
|
Search completed in 0.002 seconds
|
