|
|
A086492
|
|
Group the natural numbers such that the n-th group sum is divisible by prime(n): (1, 2, 3), (4, 5), (6, 7, 8, 9), (10, 11), (12, 13, 14, 15, 16, 17, 18, 19, 20, 21), ... Sequence contains (the sum of the terms in the n-th group)/prime(n): a(n) = A086491(n)/prime(n).
|
|
3
|
|
|
3, 3, 6, 3, 15, 18, 14, 2, 30, 18, 75, 111, 98, 116, 12, 180, 12, 52, 140, 306, 115, 185, 15, 285, 115, 85, 15, 185, 506, 390, 618, 494, 13, 156, 689, 497, 91, 497, 1140, 888, 1394, 459, 1161, 950, 1730, 693, 1953, 693, 189, 252, 630, 693, 2387, 33, 1419, 33, 1419
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
LINKS
|
|
|
EXAMPLE
|
a(4) = 3 = A086491(4)/prime(4) = 21/7.
|
|
MATHEMATICA
|
k = 0; Table[p = Prime[n]; k++; sm = 0; While[sm = sm + k; Mod[sm, p] > 0, k++]; sm/p, {n, 50}] (* T. D. Noe, Mar 19 2014 *)
|
|
PROG
|
(Python)
from itertools import count
from sympy import prime, primerange
def aupton(terms):
alst, naturals = [], count(1)
for p in primerange(1, prime(terms)+1):
s = next(naturals)
while s%p: s += next(naturals)
alst.append(s//p)
return alst
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|