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.
%I A009990 #35 Jul 10 2025 10:59:40 %S A009990 1,46,2116,97336,4477456,205962976,9474296896,435817657216, %T A009990 20047612231936,922190162669056,42420747482776576,1951354384207722496, %U A009990 89762301673555234816,4129065876983540801536,189937030341242876870656,8737103395697172336050176,401906756202069927458308096 %N A009990 Powers of 46. %C A009990 Same as Pisot sequences E(1, 46), L(1, 46), P(1, 46), T(1, 46). Essentially same as Pisot sequences E(46, 2116), L(46, 2116), P(46, 2116), T(46, 2116). See A008776 for definitions of Pisot sequences. %C A009990 The compositions of n in which each natural number is colored by one of p different colors are called p-colored compositions of n. For n >= 1, a(n) equals the number of 46-colored compositions of n such that no adjacent parts have the same color. - _Milan Janjic_, Nov 17 2011 %H A009990 T. D. Noe, <a href="/A009990/b009990.txt">Table of n, a(n) for n = 0..100</a> %H A009990 Tanya Khovanova, <a href="http://www.tanyakhovanova.com/RecursiveSequences/RecursiveSequences.html">Recursive Sequences</a>. %H A009990 <a href="/index/Rec#order_01">Index entries for linear recurrences with constant coefficients</a>, signature (46). %F A009990 G.f.: 1/(1-46*x). - _Philippe Deléham_, Nov 24 2008 %F A009990 a(n) = 46^n; a(n) = 46*a(n-1), a(0)=1. - _Vincenzo Librandi_, Nov 21 2010 %F A009990 From _Elmo R. Oliveira_, Jul 10 2025: (Start) %F A009990 E.g.f.: exp(46*x). %F A009990 a(n) = A000079(n)*A009967(n). (End) %t A009990 46^Range[0,20] (* or *) NestList[46#&,1,20] (* _Harvey P. Dale_, Jan 15 2017 *) %o A009990 (Magma)[46^n: n in [0..20]]; // _Vincenzo Librandi_, Nov 21 2010 %Y A009990 Cf. A000079, A008776, A009967. %K A009990 nonn,easy %O A009990 0,2 %A A009990 _N. J. A. Sloane_