

A114112


a(1)=1; for n>1, a(n) is the smallest positive integer not occurring earlier in the sequence such that a(n) does not divide sum{k=1 to n1} a(k).


2



1, 2, 4, 3, 6, 5, 8, 7, 10, 9, 12, 11, 14, 13, 16, 15, 18, 17, 20, 19, 22, 21, 24, 23, 26, 25, 28, 27, 30, 29, 32, 31, 34, 33, 36, 35, 38, 37, 40, 39, 42, 41, 44, 43, 46, 45, 48, 47, 50, 49, 52, 51, 54, 53, 56, 55, 58, 57, 60, 59, 62, 61, 64, 63, 66, 65, 68, 67, 70, 69, 72, 71
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

1,2


LINKS

Table of n, a(n) for n=1..72.


FORMULA

a(1)=1. a(2)=2. For n>=3, a(n) = A014681(n) = A103889(n).


MATHEMATICA

a[1] = 1; a[n_] := a[n] = Block[{k = 1, s, t = Table[ a[i], {i, n  1}]}, s = Plus @@ t; While[ Position[t, k] != {}  Mod[s, k] == 0, k++ ]; k]; Array[a, 72] (* Robert G. Wilson v *)


CROSSREFS

Cf. A014681, A103889, A114113.
Sequence in context: A110458 A217559 A217560 * A113981 A234519 A289726
Adjacent sequences: A114109 A114110 A114111 * A114113 A114114 A114115


KEYWORD

easy,nonn


AUTHOR

Leroy Quet, Nov 13 2005


EXTENSIONS

More terms from Robert G. Wilson v, Nov 18 2005


STATUS

approved



