OFFSET
0,2
COMMENTS
A self-describing sequence. Pick any number n; this n says: "There are n terms in the sequence which are < 2n". This sequence is the slowest increasing one with this property. See comments on A037988. - Eric Angelini, Jun 15 2007
LINKS
Michael De Vlieger, Table of n, a(n) for n = 0..10000
Jon Maiga, Computer-generated formulas for A094591, Sequence Machine.
FORMULA
From Andrey Zabolotskiy, Oct 28 2021: (Start)
a(n) = A037988(n-1) + 1. [Conjectured by the original author, apparently proved by Eric Angelini.]
The first differences are A272729. [discovered by Sequence Machine] (End)
MATHEMATICA
Block[{a = {1}}, Do[AppendTo[a, i + Last@ TakeWhile[a, # <= i &]], {i, 65}]; a] (* Michael De Vlieger, Sep 04 2017 *)
PROG
(Python)
def aupton(nn):
alst = [1]
for n in range(1, nn+1):
alst.append(n + max(k for k in alst if k <= n))
return alst
print(aupton(65)) # Michael S. Branicky, Oct 28 2021
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Leroy Quet, Jun 07 2004
EXTENSIONS
More terms from Vladeta Jovovic, Jun 11 2004
STATUS
approved