|
Search: id:A070192
|
|
|
| A070192 |
|
Numbers n such that n divides the numerator of B(2n) (the Bernoulli numbers), but gcd(3n,8^n+1) > 3. |
|
+0
4
|
|
| 301, 737, 1505, 1655, 2107, 3197, 3311, 3913, 5117, 5159, 5219, 5719, 6275, 6923, 7385, 7513, 7525, 8107, 8275, 8729, 9331, 9581, 9835, 10535, 10849, 11137, 11585, 12341, 12529, 12943, 13301, 14003, 14147, 14749, 15953, 15985, 17759, 18361
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
Equivalently, n is in A069040 but not in A070191.
|
|
MATHEMATICA
|
testb[n_] := Select[First/@FactorInteger[n], Mod[2n, #-1]==0&]=={}; test8[n_] := GCD[3n, PowerMod[8, n, 3n]+1]==3; Select[Range[19000], testb[ # ]&&!test8[ # ]&]
|
|
CROSSREFS
|
Cf. A069040, A070191, A070193.
Sequence in context: A051306 A004225 A004226 this_sequence A028499 A068258 A075407
Adjacent sequences: A070189 A070190 A070191 this_sequence A070193 A070194 A070195
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Benoit Cloitre (benoit7848c(AT)orange.fr) and Dean Hickerson (dean(AT)math.ucdavis.edu), Apr 26 2002
|
|
|
Search completed in 0.002 seconds
|
