|
|
A080900
|
|
a(1)=1; for n>1, a(n)=a(n-1)-2 if n is already in the sequence, a(n)=a(n-1)+5 otherwise.
|
|
14
|
|
|
1, 6, 11, 16, 21, 19, 24, 29, 34, 39, 37, 42, 47, 52, 57, 55, 60, 65, 63, 68, 66, 71, 76, 74, 79, 84, 89, 94, 92, 97, 102, 107, 112, 110, 115, 120, 118, 123, 121, 126, 131, 129, 134, 139, 144, 149, 147, 152, 157, 162, 167, 165, 170, 175, 173, 178, 176
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
LINKS
|
|
|
FORMULA
|
Perhaps this is asymptotic to c_0*n*(1 + c_1/log n + ...), with c_0 near 2 ?
|
|
MATHEMATICA
|
Fold[Append[#1, #1[[-1]] + If[MemberQ[#1, #2], -2, 5]] &, {1}, Range[2, 57]] (* Ivan Neretin, Mar 03 2016 *)
|
|
PROG
|
(PARI)
up_to = 1001;
A080900list(up_to_n) = { my(xs=Map(), v=vector(up_to_n)); mapput(xs, 1, 1); v[1] = 1; for(n=2, up_to_n, v[n] = v[n-1]+if(mapisdefined(xs, n), -2, +5); mapput(xs, v[n], n)); (v); };
v080900 = A080900list(up_to);
|
|
CROSSREFS
|
Cf. A080901 (starting value = 2), A080905 (run lengths of first differences).
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|