login

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”).

a(1)=1, a(n)=n*25^(n-1)+a(n-1).
2

%I #13 Feb 12 2024 06:37:07

%S 1,51,1926,64426,2017551,60611301,1769595676,50597720676,

%T 1423888736301,39570861392551,1088612609439426,29698842101626926,

%U 804559224181705051,21666184895568423801,580459729664855533176

%N a(1)=1, a(n)=n*25^(n-1)+a(n-1).

%H <a href="/index/Rec#order_03">Index entries for linear recurrences with constant coefficients</a>, signature (51, -675, 625).

%F a(1)=1, a(2)=51, a(3)=1926, a(n)=51*a(n-1)-675*a(n-2)+625*a(n-3). - _Harvey P. Dale_, Dec 16 2012

%t RecurrenceTable[{a[1]==1,a[n]==n*25^(n-1)+a[n-1]},a,{n,20}] (* or *)

%t LinearRecurrence[{51,-675,625},{1,51,1926},20] (* _Harvey P. Dale_, Dec 16 2012 *)

%K nonn,easy

%O 1,2

%A _Olivier Gérard_