login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A013898 a(n) = 21^(5*n + 1). 1
21, 85766121, 350277500542221, 1430568690241985328321, 5842587018385982521381124421, 23861715484377209601555171628930521, 97453656071460446110921078004886769746621, 398010574215107679422058885600836061208944572721, 1625515384162495488635310116741260158419511738394408821 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,1
COMMENTS
a(n) mod 10 == 1 (the least significant decimal digit of each term is 1).
LINKS
Tanya Khovanova, Recursive Sequences
FORMULA
a(n) = 4084101*a(n-1), a(0)=21. - Vincenzo Librandi, May 27 2011
MATHEMATICA
NestList[4084101#&, 21, 10] (* Harvey P. Dale, Apr 17 2013 *)
PROG
(Magma) [21^(5*n+1): n in [0..10]]; // Vincenzo Librandi, May 27 2011
CROSSREFS
Cf. A009965.
Sequence in context: A033636 A138080 A013814 * A180727 A250487 A062012
KEYWORD
nonn
AUTHOR
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 18 20:26 EDT 2024. Contains 371781 sequences. (Running on oeis4.)