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 A252994 #17 Apr 08 2025 16:37:50 %S A252994 0,26,52,78,104,130,156,182,208,234,260,286,312,338,364,390,416,442, %T A252994 468,494,520,546,572,598,624,650,676,702,728,754,780,806,832,858,884, %U A252994 910,936,962,988,1014,1040,1066,1092,1118,1144,1170,1196,1222,1248,1274,1300,1326,1352,1378 %N A252994 Multiples of 26. %D A252994 Richard A. Mollin, Codes: The Guide to Secrecy From Ancient to Modern Times. Chapman and Hall/CRC (2005): 12. %D A252994 Anne L. Young, Mathematical Ciphers: From Caesar to RSA. American Mathematical Society (2006): 23. %H A252994 <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (2,-1). %F A252994 a(n) = 26*n. %F A252994 a(n) = 2*a(n-1) - a(n-2). %F A252994 G.f.: 26*x/(1-x)^2. - _Georg Fischer_, Feb 25 2019 %F A252994 From _Elmo R. Oliveira_, Apr 08 2025: (Start) %F A252994 E.g.f.: 26*x*exp(x). %F A252994 a(n) = A005843(A008595(n)). (End) %t A252994 26 Range[0, 51] %o A252994 (PARI) a(n)=26*n \\ _Georg Fischer_, Feb 25 2019 %Y A252994 Cf. A005843, A008595, A008607, A244633. %K A252994 nonn,easy %O A252994 0,2 %A A252994 _Alonso del Arte_, Dec 25 2014