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”).

A120579
Irregular array where the n-th row are the divisors, not occurring earlier in the sequence, of the sum of the terms in all previous rows. a(1)=5.
3
5, 1, 2, 3, 6, 17, 34, 4, 68, 7, 10, 14, 20, 28, 35, 70, 140, 8, 16, 29, 58, 116, 232, 464, 19, 73, 1387, 1433, 2866, 7165, 14330, 5732, 28660, 11, 22, 44, 15763, 31526, 63052, 38, 55, 83, 95, 110, 166, 190, 209, 415, 418, 830, 913, 1045, 1577, 1826, 2090, 3154, 4565
OFFSET
1,1
COMMENTS
Is this sequence a permutation of the positive integers?
LINKS
John Tyler Rascoe, Rows n = 1..100, flattened
EXAMPLE
Array begins:
5
1
2,3,6
17
34
Now these terms add up to 68. So row 6 is the divisors of 68 which do not occur earlier in the sequence. 1, 2, 17 and 34 occur in earlier rows, so row 6 is (4,68).
MATHEMATICA
f[t_] := Flatten[Append[t, Select[Divisors[Plus @@ t], FreeQ[t, # ] &]]]; Nest[f, {5}, 14] (* Ray Chandler, Jun 17 2006 *)
PROG
(Python)
def A120579(rowmax):
A = [5]
for n in range(2, rowmax+1):
A.extend(k for k in divisors(sum(A)) if k not in A)
return A # John Tyler Rascoe, Jan 10 2025
CROSSREFS
KEYWORD
nonn,look,tabf,changed
AUTHOR
Leroy Quet, Jun 15 2006
EXTENSIONS
Extended by Ray Chandler, Jun 17 2006
STATUS
approved