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!)
A113876 a(n) = a(n-1) + 2^(k(n)), where k(n) is the n-th term of the sequence formed by k(1)=0 together with the numbers A042964. 1

%I #13 Jul 03 2023 08:14:35

%S 1,5,13,77,205,1229,3277,19661,52429,314573,838861,5033165,13421773,

%T 80530637,214748365,1288490189,3435973837,20615843021,54975581389,

%U 329853488333,879609302221,5277655813325,14073748835533,84442493013197

%N a(n) = a(n-1) + 2^(k(n)), where k(n) is the n-th term of the sequence formed by k(1)=0 together with the numbers A042964.

%H Vincenzo Librandi, <a href="/A113876/b113876.txt">Table of n, a(n) for n = 1..300</a>

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

%F G.f.: (1+x-8*x^2)/(2*(-1+x)*(-1+4*x)*(1+4*x)). - _Vaclav Kotesovec_, Nov 28 2012

%Y Cf. A099974, A112627, A080355, A080567, A099969, A099970, A099971.

%K nonn

%O 1,2

%A _Artur Jasinski_, Jan 27 2006

%E Edited with better definition and offset corrected by _Omar E. Pol_, Jan 08 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 24 20:08 EDT 2024. Contains 371963 sequences. (Running on oeis4.)