login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A339731 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 distance between g_1 and g_n. 4
0, 1, 2, 2, 3, 3, 4, 4, 3, 4, 5, 4, 5, 5, 4, 5, 6, 5, 6, 6, 5, 6, 7, 6, 7, 6, 7, 7, 8, 8, 8, 7, 6, 7, 8, 7, 8, 7, 6, 7, 8, 8, 9, 8, 8, 8, 9, 9, 9, 8, 7, 8, 9, 9, 9, 8, 7, 8, 9, 10, 10, 9, 10, 10, 10, 10, 10, 9, 8, 9, 10, 10, 10, 9, 10, 11, 11, 11, 11, 10, 10 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,3

LINKS

Rémy Sigrist, Table of n, a(n) for n = 1..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 A339731

FORMULA

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

a(n) = A339733(n, 1).

PROG

(PARI) See Links section.

CROSSREFS

See A339695 for a similar sequence.

Cf. A064413, A064664, A339732, A339733.

Sequence in context: A340321 A340320 A059998 * A234475 A339082 A329907

Adjacent sequences:  A339728 A339729 A339730 * A339732 A339733 A339734

KEYWORD

nonn

AUTHOR

Rémy Sigrist, Dec 14 2020

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 18 07:26 EDT 2021. Contains 343995 sequences. (Running on oeis4.)