OFFSET
1,1
COMMENTS
All terms are produced by successively applying the three basic operations: exponentiation, multiplication and addition.
LINKS
Muniru A Asiru, Table of n, a(n) for n = 1..380
R. L. Goodstein, Transfinite Ordinals in Recursive Number Theory, Journal of Symbolic Logic, Vol. 12, No. 4 (Dec. 1947), pp. 123-129.
FORMULA
E.g.f.: exp(x) * x - LambertW(-x)/(1 + LambertW(-x))^3. - Vaclav Kotesovec, Dec 20 2018
EXAMPLE
a(3) = 3 + 3*3^3 = 3 + 3*27 = 8 + 81 = 84.
MAPLE
[n+n*n^n$n=1..20]; # Muniru A Asiru, Dec 07 2018
MATHEMATICA
a[n_]:=n+n*n^n; Array[a, 20] (* Stefano Spezia, Dec 07 2018 *)
PROG
(GAP) List([1..20], n->n+n*n^n); # Muniru A Asiru, Dec 07 2018
(PARI) a(n) = n+n*n^n \\ Felix Fröhlich, Dec 07 2018
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Ivan Stoykov, Dec 07 2018
EXTENSIONS
a(12)-a(19) from Stefano Spezia, Dec 07 2018
STATUS
approved