cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-1 of 1 results.

A381490 Index of second half of decomposition of integers into pairs x(i)+y(j) based on A380008 and A380009, respectively.

Original entry on oeis.org

0, 1, 0, 1, 0, 1, 0, 1, 2, 3, 2, 3, 2, 3, 2, 3, 0, 1, 0, 1, 0, 1, 0, 1, 2, 3, 2, 3, 2, 3, 2, 3, 4, 5, 4, 5, 4, 5, 4, 5, 6, 7, 6, 7, 6, 7, 6, 7, 4, 5, 4, 5, 4, 5, 4, 5, 6, 7, 6, 7, 6, 7, 6, 7, 8, 9, 8, 9, 8, 9, 8, 9, 10, 11, 10, 11, 10, 11, 10, 11, 8, 9, 8, 9, 8, 9, 8, 9
Offset: 0

Views

Author

Luis Rato, Feb 25 2025

Keywords

Comments

One coordinate of a recursive non-self-intersecting walk on the square lattice Z^2.
Every integer appears infinitely many times in the sequence.

Examples

			A380008( A381489(14)) + A380009(a(14)) = A380008(3) + A380009(2) = 6+8 = 14
		

Crossrefs

Cf. A380008 (indices of 0's), A380009.

Formula

n = A380008(A381489(n)) + A380009(a(n))
Showing 1-1 of 1 results.