A084511 -id:A084511 - cp's OEIS frontend

A084515 Partial sums of A084516.

0, 1, 3, 6, 9, 12, 16, 20, 24, 28, 32, 36, 40, 44, 48, 52, 56, 60, 64, 69, 74, 79, 84, 89, 94, 99, 104, 109, 114, 119, 124, 129, 134, 139, 144, 149, 154, 159, 164, 169, 174, 179, 184, 189, 194, 199, 204, 209, 214, 219, 224, 229, 234, 239, 244, 249, 254, 259, 264, 269

Offset: 0

Antti Karttunen, Jun 02 2003

nonn

For n>=1, (a(n-1)+1,a(n)) = (1,1),(2,3),(4,6),(7,9),(10,12),... gives the starting and ending offsets of the n-th site swap in the sequence A084511. Gives also the positions of 7s (ground states) in A084513.

A. Karttunen, Scheme-program for computing this sequence

Differs from A084525 first time at the 18th term, where A084515(18) = 64, while A084525(18) = 65.

Cf. also A084505.

A084510 a(0)=0, after which each n occurs A084516(n) times.

Original entry on oeis.org

0, 1, 2, 2, 3, 3, 3, 4, 4, 4, 5, 5, 5, 6, 6, 6, 6, 7, 7, 7, 7, 8, 8, 8, 8, 9, 9, 9, 9, 10, 10, 10, 10, 11, 11, 11, 11, 12, 12, 12, 12, 13, 13, 13, 13, 14, 14, 14, 14, 15, 15, 15, 15, 16, 16, 16, 16, 17, 17, 17, 17, 18, 18, 18, 18, 19, 19, 19, 19, 19, 20, 20, 20, 20, 20, 21, 21, 21, 21

Offset: 0

Antti Karttunen, Jun 02 2003

nonn

Also minimum i such that A084515(i) >= n. Tells that the n-th throw (n>=1) in A084511 belongs to the a(n)-th lexicographical solution A084512(a(n)).

A. Karttunen, Scheme-program for computing this sequence

Differs from A084520 first time at the 65th term, where A084510(65) = 19, while A084520(65) = 18.

Cf. A084500.

cp's OEIS Frontend

A084515 Partial sums of A084516.

Views

Author

Keywords

Comments

Links

Crossrefs