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.

A013898 a(n) = 21^(5*n + 1).

Original entry on oeis.org

21, 85766121, 350277500542221, 1430568690241985328321, 5842587018385982521381124421, 23861715484377209601555171628930521, 97453656071460446110921078004886769746621, 398010574215107679422058885600836061208944572721, 1625515384162495488635310116741260158419511738394408821
Offset: 0

Views

Author

Keywords

Comments

a(n) mod 10 == 1 (the least significant decimal digit of each term is 1).

Crossrefs

Cf. A009965.

Programs

Formula

a(n) = 4084101*a(n-1), a(0)=21. - Vincenzo Librandi, May 27 2011