login

Revision History for A255524

(Bold, blue-underlined text is an addition; faded, red-underlined text is a deletion.)

Showing entries 1-10 | older changes
Let EKG-n denote the EKG sequence (A064413) started with n rather than 2, and suppose EKG-n first merges with some other EKG-i (i >= 2) sequence after f(n) (= A255583(n)) steps; then a(n) = smallest value of i such that EKG-i meets EKG-n after f(n) steps.
(history; published version)
#14 by N. J. A. Sloane at Sat Feb 28 14:37:48 EST 2015
STATUS

editing

approved

#13 by N. J. A. Sloane at Sat Feb 28 14:37:06 EST 2015
CROSSREFS

Cf. A255583.

STATUS

proposed

editing

Discussion
Sat Feb 28
14:37
N. J. A. Sloane: added missing cross-reference - all sequences mentioned in the entry should also be listed in the cross-references section
#12 by Gordon Hamilton at Thu Feb 26 23:25:54 EST 2015
STATUS

editing

proposed

#11 by Gordon Hamilton at Thu Feb 26 23:25:49 EST 2015
NAME

Let EKG-n denote the EKG sequence (A064413) started with n rather than 2, and suppose EKG-n first merges with some other EKG-i (i >= 2) sequence after f(n) (= A169857A255583(n)) steps; then a(n) = smallest value of i such that EKG-i meets EKG-n after f(n) steps.

STATUS

approved

editing

#10 by Charles R Greathouse IV at Tue Feb 24 21:00:20 EST 2015
STATUS

proposed

approved

#9 by Gordon Hamilton at Tue Feb 24 20:07:37 EST 2015
STATUS

editing

proposed

Discussion
Tue Feb 24
20:36
Gordon Hamilton: Merging needs to be precisely defined: Two sequences merge if they are identical from that point forward.
#8 by Gordon Hamilton at Tue Feb 24 20:04:11 EST 2015
NAME

Let EKG-n denote the EKG sequence (A064413) started with n rather than 2, and suppose EKG-n first merges with some other EKG-i (i >= 32) sequence after f(n) (= A169857(n)) steps; then a(n) = smallest value of i such that EKG-i meets EKG-n after f(n) steps.

STATUS

approved

editing

Discussion
Tue Feb 24
20:07
Gordon Hamilton: This includes the original EKG-2 sequence.  EKG-2 is closest to EKG-4 is what the first term describes.
#7 by N. J. A. Sloane at Tue Feb 24 16:52:46 EST 2015
STATUS

editing

approved

#6 by N. J. A. Sloane at Tue Feb 24 16:52:43 EST 2015
NAME

Let EKG-n denote the EKG sequence (A064413) started with n instead of rather than 2, and suppose EKG-n first merges with some other EKG-i (i >= 3) sequence after f(n) (= A169857(n)) steps; then a(n) = smallest value of i such that EKG-i meets EKG-n after f(n) steps.

STATUS

approved

editing

#5 by N. J. A. Sloane at Tue Feb 24 16:44:45 EST 2015
STATUS

editing

approved