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 A242570 #32 Mar 25 2025 11:06:52
%S A242570 0,252,504,756,1008,1260,1512,1764,2016,2268,2520,2772,3024,3276,3528,
%T A242570 3780,4032,4284,4536,4788,5040,5292,5544,5796,6048,6300,6552,6804,
%U A242570 7056,7308,7560,7812,8064,8316,8568,8820,9072,9324,9576,9828,10080,10332,10584,10836,11088,11340
%N A242570 a(n) = 252 * n.
%C A242570 As lcm(1,2,3,...,9) = 2520, 10*a(n) + k is divisible by each k from 1 through 9.
%H A242570 <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (2,-1).
%F A242570 From _Elmo R. Oliveira_, Apr 16 2024: (Start)
%F A242570 G.f.: 252*x/(x-1)^2.
%F A242570 E.g.f.: 252*x*exp(x).
%F A242570 a(n) = 2*a(n-1) - a(n-2) for n >= 2.
%F A242570 a(n) = 7*A044102(n) = 9*A135628(n) = 12*A008603(n) = 14*A008600(n) = 18*A008596(n) = 21*A008594(n) = 28*A008591(n) = 36*A008589(n) = 252*A001477(n). (End)
%t A242570 252*Range[0, 49] (* _Alonso del Arte_, May 17 2014 *)
%t A242570 LinearRecurrence[{2,-1},{0,252},50] (* _Harvey P. Dale_, Mar 25 2025 *)
%o A242570 (PARI) for(n=0,50,print(252*n))
%Y A242570 Cf. A001477, A008600, A008603, A008589, A008591, A008594, A008596.
%Y A242570 Cf. A044102, A135628.
%K A242570 nonn,easy,less
%O A242570 0,2
%A A242570 _Derek Orr_, May 17 2014