cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A064748 a(n) = n*10^n + 1.

Original entry on oeis.org

1, 11, 201, 3001, 40001, 500001, 6000001, 70000001, 800000001, 9000000001, 100000000001, 1100000000001, 12000000000001, 130000000000001, 1400000000000001, 15000000000000001, 160000000000000001, 1700000000000000001, 18000000000000000001, 190000000000000000001
Offset: 0

Views

Author

N. J. A. Sloane, Oct 19 2001

Keywords

Comments

Number of digits in (10^n)^(10^n) in base 10. - Altug Alkan, Apr 25 2016

Crossrefs

Programs

Formula

From Ilya Gutkovskiy, Apr 25 2016: (Start)
O.g.f.: (1 - 10*x + 90*x^2)/((1 - x)*(1 - 10*x)^2).
E.g.f.: (1 + 10*x*exp(9*x))*exp(x). (End)
From Elmo R. Oliveira, May 03 2025: (Start)
a(n) = 21*a(n-1) - 120*a(n-2) + 100*a(n-3).
a(n) = A126431(n) + 1. (End)