login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A141845 a(n) = 5*a(n-1) + A047201(n), a(1) = 1. A047201 = numbers not divisible by 5: (1, 2, 3, 4, 6, 7, 8, 9, 11, ...). 0

%I #14 Feb 08 2022 21:57:43

%S 1,7,38,194,976,4887,24443,122224,611131,3055667,15278348,76391754,

%T 381958786,1909793947,9548969753,47744848784,238724243941,

%U 1193621219727,5968106098658,29840530493314,149202652466596,746013262333007

%N a(n) = 5*a(n-1) + A047201(n), a(1) = 1. A047201 = numbers not divisible by 5: (1, 2, 3, 4, 6, 7, 8, 9, 11, ...).

%H <a href="/index/Rec#order_06">Index entries for linear recurrences with constant coefficients</a>, signature (6,-5,0,1,-6,5).

%F G.f.: (1+x+x^2+x^3+x^4)/((1-x)^2(1+x)(1+x^2)(1-5x)). - _R. J. Mathar_, Sep 06 2008

%e a(4) = 194 = 5*a(3) + A047201(4) = 5*38 + 4.

%Y Cf. A047201.

%K nonn

%O 1,2

%A _Gary W. Adamson_, Jul 11 2008

%E Extended and corrected by _R. J. Mathar_, Sep 06 2008

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 24 22:17 EDT 2024. Contains 371964 sequences. (Running on oeis4.)