login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

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
OFFSET
1,1
LINKS
Michael S. Branicky, Table of n, a(n) for n = 1..10000 (terms 1..1000 from Zak Seidov)
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
print(aupton(57)) # Michael S. Branicky, Jun 09 2021
CROSSREFS
Sequence in context: A120909 A086222 A278663 * A372036 A143305 A051472
KEYWORD
nonn
AUTHOR
Amarnath Murthy, Jul 28 2003
EXTENSIONS
More terms from Ray Chandler, Sep 16 2003
STATUS
approved