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 A053654 #23 Jun 30 2025 21:44:23 %S A053654 123456789,246913578,370370367,493827156,617283945,740740734, %T A053654 864197523,987654312,1111111101,1234567890,1358024679,1481481468, %U A053654 1604938257,1728395046,1851851835,1975308624,2098765413,2222222202,2345678991,2469135780,2592592569,2716049358,2839506147 %N A053654 Multiples of 123456789. %D A053654 W. Lietzmann, Sonderlinge im Reich der Zahlen, Ferd. Duemmlers Verlag Bonn, 1948, p. 29. %H A053654 Michael De Vlieger, <a href="/A053654/b053654.txt">Table of n, a(n) for n = 1..10000</a> %H A053654 Tanya Khovanova, <a href="http://www.tanyakhovanova.com/RecursiveSequences/RecursiveSequences.html">Recursive Sequences</a>. %H A053654 <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (2,-1). %F A053654 a(n) = 2*a(n-1) - a(n-2). - _Wesley Ivan Hurt_, Apr 25 2023 %F A053654 From _Elmo R. Oliveira_, Jun 26 2025: (Start) %F A053654 G.f.: 123456789*x/(1-x)^2. %F A053654 E.g.f.: 123456789*x*exp(x). %F A053654 a(n) = 123456789*n = 13717421*A008591(n). (End) %t A053654 Array[123456789 # &, 19] (* _Michael De Vlieger_, May 15 2018 *) %o A053654 (PARI) a(n)=123456789*n \\ _Charles R Greathouse IV_, Jul 10 2016 %Y A053654 Subsequence of A008591. %K A053654 easy,nonn %O A053654 1,1 %A A053654 Klaus Strassburger (strass(AT)ddfi.uni-duesseldorf.de), Feb 17 2000