OFFSET
0,1
COMMENTS
The smallest legal term is 2, otherwise for a(n) = 1: a(n+1) = a(n + 1) - 1.
LINKS
Rémy Sigrist, Table of n, a(n) for n = 0..10000
Rémy Sigrist, C++ program for A319579
Rémy Sigrist, Scatterplot of the first 100000 terms
FORMULA
a(n+1) = a(n + a(n)) - a(n).
EXAMPLE
a(0) = 2, because it's the smallest positive integer that satisfies the rule a(n+1) = a(n + a(n)) - a(n).
a(1) = 2, because we have again free choice inside the rules.
a(2) = 4, because a(1) = a(0 + a(0)) - a(0) = a(0 + 2) - a(0) = a(2) - 2 = 2.
a(3) = 6, because a(2) = a(1 + a(1)) - a(1) = a(1 + 2) - a(1) = a(3) - 2 = 4.
a(6) = 10, because a(3) = a(2 + a(2)) - a(2) = a(2 + 4) - a(2) = a(6) - 4 = 6.
a(4) = 2, because we have again free choice inside the rules.
And so on.
PROG
(C++) See Links section.
CROSSREFS
KEYWORD
nonn
AUTHOR
Marc Morgenegg, Aug 27 2019
EXTENSIONS
Name amended by Rémy Sigrist, Oct 01 2019
STATUS
approved