|
Search: id:A007775
|
|
|
| A007775 |
|
Not divisible by 2, 3 or 5. |
|
+0
14
|
|
| 1, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 49, 53, 59, 61, 67, 71, 73, 77, 79, 83, 89, 91, 97, 101, 103, 107, 109, 113, 119, 121, 127, 131, 133, 137, 139, 143, 149, 151, 157, 161, 163, 167, 169, 173, 179, 181, 187, 191, 193, 197, 199, 203, 209
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
Also numbers n such that the sum of the 4-th powers of the first n positive integers is divisible by n, or A000538(n) = n*(n+1)(2*n+1)(3*n^2+3*n-1)/30 is divisible by n. - Alexander Adamchuk (alex(AT)kolmogorov.com), Jan 04 2007
A141256(a(n)) = n+1. - Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Jun 17 2008
|
|
LINKS
|
N. J. A. Sloane, Table of n, a(n) for n = 1..8000
Theodore E. Hahn, Title?
Theodore E. Hahn, Title?
Theodore E. Hahn, Title?
|
|
MAPLE
|
for i from 1 to 500 do if gcd(i, 30) = 1 then print(i); fi; od;
|
|
MATHEMATICA
|
Select[ Range[ 300 ], GCD[ #1, 30 ]==1& ]
|
|
CROSSREFS
|
Cf. A000538, A054403.
Adjacent sequences: A007772 A007773 A007774 this_sequence A007776 A007777 A007778
Sequence in context: A112588 A128974 A005776 this_sequence A070884 A135777 A090459
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
njas
|
|
|
Search completed in 0.002 seconds
|
