|
|
OFFSET
| 1,2
|
|
|
COMMENTS
| Prime p divides A014137(p) for p = {2, 3, 5, 11, 17, 23, 29, 41, 47, 53, 59, 71, 83, 89, 101, ...} = A045309 Primes congruent to {0, 2} mod 3 = A045309 Primes p such that x^3 = n (integer) has only one solution mod p.
|
|
|
EXAMPLE
| A014137(n) begins {1, 2, 4, 9, 23, 65, 197, 626, 2056, 6918, 23714, 82500, ...}.
Thus a(1) = 1 because 1 is nonprime and divides A014137(1) = 2.
a(2) = 8 because 8 is nonprime and divides A014137(8) = 2056 and A014137(n) is not divisible by any nonprime n for 1<n<8.
|
|
|
MATHEMATICA
| s = 1; Do[s = s + (2n)!/n!/(n+1)!; If[ !PrimeQ[n] && Mod[s, n] == 0, Print[n]], {n, 1000}]
|
|
|
CROSSREFS
| Cf. A014137, A000108, A045309, A045309.
Sequence in context: A073701 A187609 A079912 * A003375 A007032 A069988
Adjacent sequences: A128284 A128285 A128286 * A128288 A128289 A128290
|
|
|
KEYWORD
| bref,hard,more,nonn
|
|
|
AUTHOR
| Alexander Adamchuk (alex(AT)kolmogorov.com), Feb 23 2007
|
|
|
EXTENSIONS
| One more term from Ryan Propper (rpropper(AT)stanford.edu), Apr 02 2007
|
|
