|
%I #24 Sep 08 2022 08:44:38
%S 21,85766121,350277500542221,1430568690241985328321,
%T 5842587018385982521381124421,23861715484377209601555171628930521,
%U 97453656071460446110921078004886769746621,398010574215107679422058885600836061208944572721,1625515384162495488635310116741260158419511738394408821
%N a(n) = 21^(5*n + 1).
%C a(n) mod 10 == 1 (the least significant decimal digit of each term is 1).
%H Vincenzo Librandi, <a href="/A013898/b013898.txt">Table of n, a(n) for n = 0..50</a>
%H Tanya Khovanova, <a href="http://www.tanyakhovanova.com/RecursiveSequences/RecursiveSequences.html">Recursive Sequences</a>
%H <a href="/index/Rec#order_01">Index entries for linear recurrences with constant coefficients</a>, signature (4084101).
%F a(n) = 4084101*a(n-1), a(0)=21. - _Vincenzo Librandi_, May 27 2011
%t NestList[4084101#&,21,10] (* _Harvey P. Dale_, Apr 17 2013 *)
%o (Magma) [21^(5*n+1): n in [0..10]]; // _Vincenzo Librandi_, May 27 2011
%Y Cf. A009965.
%K nonn
%O 0,1
%A _N. J. A. Sloane_
| 