A169857 Consider the EKG sequence (A064413) started at n instead of 2; a(n) = number of steps before sequence merges with A064413, or 0 if the two sequences never merge.

0, 44, 3, 44, 44, 44, 8, 44, 44, 48, 44, 44, 44, 18, 17, 58, 18, 51, 18, 44, 48, 62, 48, 44, 47, 44, 48, 82, 48, 90, 31, 48, 65, 44, 48, 101, 71, 47, 48, 116, 48, 129, 41, 39, 87, 135, 48, 65, 46, 65, 47, 148, 48, 104, 58, 71, 105, 168, 104, 187, 121, 69, 64, 69

Offset: 2

Author

T. D. Noe and N. J. A. Sloane, Jun 02 2010

Keywords

• nonn

Comments

For the purpose of this sequence, ignore the initial 1 in A064413 and imagine that it begins with the 2.

The upper points appear to occur at primes, the points just below the upper points at twice primes.

Are there any zeros?

Links

• T. D. Noe, Table of n, a(n) for n=2..3000
• Gordon Hamilton, The EKG Sequence and the Tree of Numbers
• Gordon Hamilton, Untitled video related to previous video

Crossrefs

Cf. A064413, A064421, A169837-A169856, A119415.