A339696 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 number of nodes at distance n from g_0.

1, 1, 2, 2, 3, 3, 5, 3, 6, 7, 6, 5, 8, 9, 10, 5, 8, 10, 16, 12, 15, 12, 12, 7, 14, 18, 18, 16, 20, 17, 18, 7, 14, 18, 18, 17, 25, 29, 33, 21, 28, 30, 31, 22, 25, 24, 22, 11, 18, 24, 38, 31, 39, 35, 37, 25, 42, 46, 37, 29, 37, 33, 30, 11, 18, 24, 38, 31, 39, 35

Offset

0,3

Links

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

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, PARI program for A339696

Crossrefs

Cf. A003188, A006068, A339695, A339697.

Sequence in context: A230846 A204908 A340265 * A263027 A069974 A039650

Adjacent sequences: A339693 A339694 A339695 * A339697 A339698 A339699

Keyword

nonn

Author

Rémy Sigrist, Dec 13 2020

Status

approved