|
Search: id:A004611
|
|
|
| A004611 |
|
Divisible only by primes congruent to 1 mod 3. |
|
+0
5
|
|
| 1, 7, 13, 19, 31, 37, 43, 49, 61, 67, 73, 79, 91, 97, 103, 109, 127, 133, 139, 151, 157, 163, 169, 181, 193, 199, 211, 217, 223, 229, 241, 247, 259, 271, 277, 283, 301, 307, 313, 331, 337, 343, 349, 361, 367, 373, 379, 397, 403, 409, 421, 427, 433, 439, 457
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
Equivalently, products of primes == 1 (mod 6).
Positive integers n such that n+d+1 is divisible by 3 for all divisors d of n. For example, a(13)=91 since 91=7*13, 91+1+1=93=3*31, 91+7+1=99=9*11, 91+13+1=105=3*7*5, 91+91+1=183=3*61. The only prime p such that x+d+1 is divisible by p for all divisors d of x is p=3. The sequence consists of 1 and all integers whose prime divisors are of the form 6k+1. - Walter Kehowski (wkehowski(AT)cox.net), Aug 09 2006.
|
|
LINKS
|
T. D. Noe, Table of n, a(n) for n=1..10000
J. H. Conway, E. M. Rains and N. J. A. Sloane, On the existence of similar sublattices, Canad. J. Math. 51 (1999), 1300-1306 (Abstract, pdf, ps).
Walter Kehowski, D Numbers.
|
|
MAPLE
|
with(numtheory): for n from 1 to 1801 by 6 do it1 := ifactors(n)[2]: it2 := 1: for i from 1 to nops(it1) do if it1[i][1] mod 6 > 1 then it2 := 0; break fi: od: if it2=1 then printf(`%d, `, n) fi: od:
with(numtheory): cnt:=0: L:=[]: for w to 1 do for n from 1 while cnt<100 do dn:=divisors(n); Q:=map(z-> n+z+1, dn); if andmap(z-> z mod 3 = 0, Q) then cnt:=cnt+1; L:=[op(L), [cnt, n]]; fi; od od; L; - Walter Kehowski (wkehowski(AT)cox.net), Aug 09 2006.
|
|
CROSSREFS
|
Cf. A120806.
Sequence in context: A101324 A129904 A088513 this_sequence A133290 A038590 A129389
Adjacent sequences: A004608 A004609 A004610 this_sequence A004612 A004613 A004614
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
njas
|
|
EXTENSIONS
|
More terms from James A. Sellers (sellersj(AT)math.psu.edu), Oct 30 2000
Edited by njas at the suggestion of Andrew Plewe, May 31 2007
|
|
|
Search completed in 0.002 seconds
|
