The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
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!)
A130750 Binomial transform of A010882. 8

%I #14 Sep 08 2022 08:45:30

%S 1,3,8,17,33,64,127,255,512,1025,2049,4096,8191,16383,32768,65537,

%T 131073,262144,524287,1048575,2097152,4194305,8388609,16777216,

%U 33554431,67108863,134217728,268435457,536870913,1073741824,2147483647

%N Binomial transform of A010882.

%C The first sequence of "less twisted numbers"; this sequence, A130752 and A130755 form a "suite en trio" (cf. reference, p. 130).

%C First differences of A130755, second differences of A130752.

%C Sequence equals its third differences:

%C 1 3 8 17 33 64 127 255 512 1025

%C 2 5 9 16 31 63 128 257 513

%C 3 4 7 15 32 65 129 256

%C 1 3 8 17 33 64 127

%D P. Curtz, Exercise Book, manuscript, 1995.

%H G. C. Greubel, <a href="/A130750/b130750.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 (3,-3,2).

%F G.f.: (1+2*x^2)/((1-2*x)*(1-x+x^2)).

%F a(0) = 1; a(1) = 3; a(2) = 8; for n > 2, a(n) = 3*a(n-1) - 3*a(n-2) + 2*a(n-3).

%F a(n) = 2^(n+1) + A128834(n+4).

%F a(0) = 1; for n > 0, a(n) = 2*a(n-1) + A057079(n-1).

%t CoefficientList[Series[(1+2*x^2)/((1-2*x)*(1-x+x^2)), {x, 0, 50}], x] (* or *) LinearRecurrence[{3,-3,2}, {1,3,8}, 30] (* _G. C. Greubel_, Jan 15 2018 *)

%o (Magma) m:=31; S:=[ [1, 2, 3][(n-1) mod 3 +1]: n in [1..m] ]; [ &+[ Binomial(i-1, k-1)*S[k]: k in [1..i] ]: i in [1..m] ]; // _Klaus Brockhaus_, Aug 03 2007

%o (Magma) I:=[1,3,8]; [n le 3 select I[n] else 3*Self(n-1) - 3*Self(n-2) + 2*Self(n-3): n in [1..30]]; // _G. C. Greubel_, Jan 15 2018

%o (PARI) {m=31; v=vector(m); v[1]=1; v[2]=3; v[3]=8; for(n=4, m, v[n]=3*v[n-1]-3*v[n-2]+2*v[n-3]); v} \\ _Klaus Brockhaus_, Aug 03 2007

%o (PARI) {for(n=0, 30, print1(2^(n+1)+[ -1, -1,0, 1, 1, 0][n%6+1], ","))} \\ _Klaus Brockhaus_, Aug 03 2007

%Y Cf. A010882 (periodic (1, 2, 3)), A128834 (periodic (0, 1, 1, 0, -1, -1)), A057079 (periodic (1, 2, 1, -1, -2, -1)), A130752 (first differences), A130755 (second differences).

%K nonn,easy

%O 0,2

%A _Paul Curtz_, Jul 13 2007

%E Edited and extended by _Klaus Brockhaus_, Aug 03 2007

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 June 5 16:08 EDT 2024. Contains 373107 sequences. (Running on oeis4.)