A339695 Let G be the undirected graph with nodes {g_k, k >= 0} such that for any k >= 0, g_k is connected to g_{k+1} and g_{A006068(k)} is connected to g_{A006068(k+1)}; a(n) is the distance between g_0 and g_n.

0, 1, 2, 2, 3, 4, 4, 3, 4, 5, 6, 6, 6, 5, 6, 5, 6, 7, 8, 8, 9, 10, 10, 9, 9, 8, 7, 8, 9, 9, 8, 7, 8, 9, 10, 10, 11, 12, 12, 11, 12, 13, 14, 14, 14, 13, 14, 13, 13, 12, 12, 11, 10, 9, 10, 11, 12, 13, 14, 14, 13, 13, 12, 11, 12, 13, 14, 14, 15, 16, 16, 15, 16

Offset

0,3

Links

Rémy Sigrist, Table of n, a(n) for n = 0..10000

Dana G. Korssjoen, Biyao Li, Stefan Steinerberger, Raghavendra Tripathi, and Ruimin Zhang, Finding structure in sequences of real numbers via graph theory: a problem list, arXiv:2012.04625, Dec 08, 2020.

Rémy Sigrist, Illustration of initial terms

Rémy Sigrist, PARI program for A339695

Formula

abs(a(n) - a(k)) <= abs(n-k) for any n, k >= 0.

a(n) = A339697(n, 0).

Prog

(PARI) See Links section.

Crossrefs

See A339731 for a similar sequence.

Cf. A003188, A006068, A339696, A339697.

Sequence in context: A069581 A274061 A284009 * A326846 A243220 A334593

Adjacent sequences: A339692 A339693 A339694 * A339696 A339697 A339698

Keyword

nonn

Author

Rémy Sigrist, Dec 13 2020

Status

approved