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!)
A127008 a(0)=1. For n>=1, n-th run consists of the integers in descending order of a(n-1)+n-1 through n. 0

%I #12 Oct 30 2019 17:26:57

%S 1,1,2,4,3,7,6,5,4,7,6,5,12,11,10,9,8,7,6,12,11,10,9,8,7,12,11,10,9,8,

%T 12,11,10,9,16,15,14,13,12,11,10,16,15,14,13,12,11,16,15,14,13,12,24,

%U 23,22,21,20,19,18,17,16,15,14,13,24,23,22,21,20,19,18,17,16,15,14,24,23

%N a(0)=1. For n>=1, n-th run consists of the integers in descending order of a(n-1)+n-1 through n.

%e The sequence grouped by descending runs, where the n-th run, for n>=1, consists of a(n-1) integers: 1, (1), (2), (4, 3), (7, 6, 5, 4), (7, 6, 5), (12, 11, 10, 9, 8, 7, 6), (12, 11, 10, 9, 8, 7), (12, 11, 10, 9, 8), (12, 11, 10, 9), ...

%t f[l_List] := Block[{n = Length[l]},Append[l, Range[Flatten[l][[n]] + n - 1, n, -1]]];Flatten@Nest[f, {{1}}, 15] (* _Ray Chandler_, Jan 04 2007 *)

%K easy,nonn

%O 0,3

%A _Leroy Quet_, Jan 02 2007

%E Extended by _Ray Chandler_, Jan 04 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 19 23:15 EDT 2024. Contains 371798 sequences. (Running on oeis4.)