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 A097659 #33 Jul 07 2025 15:42:16
%S A097659 1,1001,1002001,1003003001,1004006004001,1005010010005001,
%T A097659 1006015020015006001,1007021035035021007001,1008028056070056028008001,
%U A097659 1009036084126126084036009001,1010045120210252210120045010001,1011055165330462462330165055011001,1012066220495792924792495220066012001
%N A097659 a(n) = 1001^n.
%C A097659 694 is the smallest exponent e such that 1001^e begins with a digit greater than 1: A000030(a(694)) = 2, A000030(a(693)) = 1. - _Reinhard Zumkeller_, Nov 05 2010
%C A097659 a(n) gives the n-th row of Pascal's triangle (A007318) as long as all the binomial coefficients have at most three digits, otherwise the binomial coefficients with more than three digits overlap. - _Daniel Forgues_, Aug 12 2012
%D A097659 Rozsa Peter, Playing with Infinity, New York, Dover Publications, 1957.
%H A097659 Tanya Khovanova, <a href="http://www.tanyakhovanova.com/RecursiveSequences/RecursiveSequences.html">Recursive Sequences</a>.
%H A097659 <a href="/index/Rec#order_01">Index entries for linear recurrences with constant coefficients</a>, signature (1001).
%F A097659 From _Philippe Deléham_, Nov 30 2008: (Start)
%F A097659 a(n) = 1001*a(n-1), n > 0; a(0)=1.
%F A097659 G.f.: 1/(1-1001*x). (End)
%F A097659 From _Elmo R. Oliveira_, Jul 06 2025: (Start)
%F A097659 E.g.f.: exp(1001*x).
%F A097659 a(n) = 91^n * A001020(n). (End)
%o A097659 (PARI) 1001^n \\ _Charles R Greathouse IV_, Jan 30 2012
%o A097659 (PARI) my(x='x+O('x^13)); Vec(-1/(1001*x-1)) \\ _Elmo R. Oliveira_, Jul 06 2025
%Y A097659 Cf. A001020, A007318, A096884, A097660.
%K A097659 nonn,easy
%O A097659 0,2
%A A097659 _Reinhard Zumkeller_, Aug 18 2004
%E A097659 More terms from _Elmo R. Oliveira_, Jul 06 2025