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!)
A088582 a(n) = n*x^n + (n-1)*x^(n-1) + . . . + x + 1 for x=4. 2

%I #19 Sep 08 2022 08:45:12

%S 1,5,37,229,1253,6373,30949,145637,669925,3029221,13514981,59652325,

%T 260978917,1133394149,4891490533,20997617893,89717094629,381774870757,

%U 1618725452005,6841405683941,28831638239461,121190614972645,508218707949797,2126699824036069

%N a(n) = n*x^n + (n-1)*x^(n-1) + . . . + x + 1 for x=4.

%C Sum of reciprocals = 1.232389931990837220821336083..

%H Colin Barker, <a href="/A088582/b088582.txt">Table of n, a(n) for n = 0..1000</a>

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

%F a(n) = (13+(3n-1)*4^(n+1))/9 = 9*a(n-1)-24*a(n-2)+16*a(n-3). G.f.: (1-4x+16x^2)/((1-x)(1-4x)^2). - _R. J. Mathar_, Jul 22 2009

%e 4*4^4 + 3*4^3 + 2*4^2 + 4 + 1 = 1253.

%t LinearRecurrence[{9, -24, 16}, {1, 5, 37}, 50] (* _Vincenzo Librandi_, Jun 14 2015 *)

%o (PARI) trajpolyn(n1,k) = { s=0; for(x1=0,n1, y1 = polypn2(k,x1); print1(y1","); s+=1.0/y1; ); print(); print(s) }

%o polypn2(n,p) = { x=n; y=1; for(m=1,p, y=y+m*x^m; ); return(y) }

%o (PARI) Vec(-(16*x^2-4*x+1)/((x-1)*(4*x-1)^2) + O(x^100)) \\ _Colin Barker_, Jun 13 2015

%o (Magma) [(13+(3*n-1)*4^(n+1))/9: n in [0..30]]; // _Vincenzo Librandi_, Jun 14 2015

%K nonn,easy

%O 0,2

%A _Cino Hilliard_, Nov 20 2003

%E Offset corrected by _R. J. Mathar_, Jul 22 2009

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 19 03:45 EDT 2024. Contains 371782 sequences. (Running on oeis4.)