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!)
A129143 Start with the empty sequence and append in step k the consecutive numbers 2^(k-1) to 2^(k-1)+k-1. 3

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

%S 1,2,3,4,5,6,8,9,10,11,16,17,18,19,20,32,33,34,35,36,37,64,65,66,67,

%T 68,69,70,128,129,130,131,132,133,134,135,256,257,258,259,260,261,262,

%U 263,264,512,513,514,515,516,517,518,519,520,521,1024,1025,1026,1027,1028

%N Start with the empty sequence and append in step k the consecutive numbers 2^(k-1) to 2^(k-1)+k-1.

%C Inspired by A127330.

%H Ivan Neretin, <a href="/A129143/b129143.txt">Table of n, a(n) for n = 1..5151</a>

%e In step 5 the numbers 2^4 to 2^4+4 are appended: 16, 17, 18, 19, 20.

%t Table[2^n + k, {n, 0, 10}, {k, 0, n}] // Flatten (* _Ivan Neretin_, Aug 30 2015 *)

%o (Magma) &cat[ [2^k..2^k+k]: k in [0..11] ];

%Y Cf. A127330, A129142.

%K nonn,easy

%O 1,2

%A _Klaus Brockhaus_, Mar 31 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 April 25 12:15 EDT 2024. Contains 371969 sequences. (Running on oeis4.)