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!)
A322832 Values x + y, where the ordered pairs (x,y) are sorted first by maximal coordinate and then lexicographically. 2
0, 1, 1, 2, 2, 3, 2, 3, 4, 3, 4, 5, 3, 4, 5, 6, 4, 5, 6, 7, 4, 5, 6, 7, 8, 5, 6, 7, 8, 9, 5, 6, 7, 8, 9, 10, 6, 7, 8, 9, 10, 11, 6, 7, 8, 9, 10, 11, 12, 7, 8, 9, 10, 11, 12, 13, 7, 8, 9, 10, 11, 12, 13, 14, 8, 9, 10, 11, 12, 13, 14, 15, 8, 9, 10, 11, 12, 13, 14, 15, 16 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,4
COMMENTS
This sequence consists of runs of length A008619(k) with initial elements A004526(k+1) and final elements A001477(k).
LINKS
FORMULA
From David A. Corneth, Jan 11 2019: (Start)
a(n^2 + j) = n + j for 0 <= j <= n-1.
a(n^2 + j) = j, n <= j <= 2*n (End)
EXAMPLE
The sorted pairs (x,y) and their sums x+y are:
(0,0) => 0
(0,1) => 1
(1,0) => 1
(1,1) => 2
(0,2) => 2
(1,2) => 3
(2,0) => 2
(2,1) => 3
(2,2) => 4
(0,3) => 3
etc.
PROG
(PARI) first(n) = {n = (sqrtint(n) + 1) ^ 2; res = vector(n); for(i = 0, sqrtint(n) - 1, res[i^2 + 1] = i; for(j = 1, i - 1, res[i ^ 2 + j + 1] = i + j; ); for(j = i, 2 * i, res[i ^ 2 + j + 1] = j; ) ); res } \\ David A. Corneth, Jan 11 2019
CROSSREFS
Sequence in context: A115726 A086413 A069352 * A348389 A073453 A123229
KEYWORD
nonn,easy,look
AUTHOR
Charlie Neder, Dec 27 2018
EXTENSIONS
Edited by N. J. A. Sloane, Dec 28 2018
STATUS
approved

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 May 13 06:21 EDT 2024. Contains 372498 sequences. (Running on oeis4.)