Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #23 Dec 08 2024 12:58:18
%S 2468,12468,22468,32468,42468,52468,62468,72468,82468,92468,102468,
%T 112468,122468,132468,142468,152468,162468,172468,182468,192468,
%U 202468,212468,222468,232468,242468,252468,262468,272468,282468,292468,302468,312468,322468,332468,342468
%N a(n) = 10000*n + 2468.
%H Vincenzo Librandi, <a href="/A102689/b102689.txt">Table of n, a(n) for n = 0..1000</a>
%H Tanya Khovanova, <a href="http://www.tanyakhovanova.com/RecursiveSequences/RecursiveSequences.html">Recursive Sequences</a>.
%H <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (2,-1).
%F From _Elmo R. Oliveira_, Dec 07 2024: (Start)
%F G.f.: 4*(617 + 1883*x)/(1 - x)^2.
%F E.g.f.: 4*exp(x)*(617 + 2500*x).
%F a(n) = 2*a(n-1) - a(n-2) for n >= 2. (End)
%t Table[10000*n+2468,{n,0,50}] (* _Harvey P. Dale_, Feb 24 2015 *)
%t LinearRecurrence[{2, -1}, {2468, 12468}, 50] (* _Vincenzo Librandi_, Aug 16 2017 *)
%o (Magma) [10000*n+2468: n in [0..50]]; // _Vincenzo Librandi_, Aug 16 2017
%K easy,nonn,less,changed
%O 0,1
%A _Giovanni Teofilatto_, Feb 25 2005