

A339732


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_{A064413(k)} is connected to g_{A064413(k+1)}; a(n) is the number of nodes at distance n from g_1.


3



1, 1, 2, 3, 5, 6, 8, 11, 15, 17, 28, 39, 48, 64, 94, 116, 164, 217, 289, 395, 542, 729, 919, 1154, 1598, 2091, 2747, 3702, 4867, 6338, 8290, 10873, 14533, 18919, 24577, 31918, 41857
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

0,3


LINKS

Table of n, a(n) for n=0..36.
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 A339732


PROG

(PARI) See Links section.


CROSSREFS

Cf. A064413, A064664, A339731, A339733.
Sequence in context: A238006 A329289 A117517 * A098491 A280449 A107947
Adjacent sequences: A339729 A339730 A339731 * A339733 A339734 A339735


KEYWORD

nonn,more


AUTHOR

Rémy Sigrist, Dec 14 2020


STATUS

approved



