A255198 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) = number of i such that EKG-i meets EKG-n after f(n) steps.
1, 1, 1, 4, 1, 6, 2, 2, 5
Offset: 2
Examples
a(5) = 4 because the EKG sequence starting with 5 (EKG-5, A169841) starts coinciding with sequences EKG-3, EKG-6, EKG-9 and EKG-12 simultaneously (when all sequences hit 18). EKG-3: 3, 6, 2, 4, 8, 10, 5, 15, 9, 12, 14, 7, 21, 18, 16, 20, 22, 11, ... (A169837) EKG-6: 6, 2, 4, 8, 10, 5, 15, 3, 9, 12, 14, 7, 21, 18, 16, 20, 22, 11, ... (A169843) EKG-9: 9, 3, 6, 2, 4, 8, 10, 5, 15, 12, 14, 7, 21, 18, 16, 20, 22, 11, ... (A169849) EKG-12: 12, 2, 4, 6, 3, 9, 15, 5, 10, 8, 14, 7, 21, 18, 16, 20, 22, 11, ... (A169855) EKG-5: 5, 10, 2, 4, 6, 3, 9, 12, 8, 14, 7, 21, 15, 18, 16, 20, 22, 11, ... (A169841) a(12) = 3 because the EKG sequence starting with 12 (EKG-12, A169855) starts coinciding with sequences EKG-3, EKG-6, and EKG-9 simultaneously (when all sequences hit 14).
Links
- Gordon Hamilton, The EKG Sequence and the Tree of Numbers, Oct 2013.
Comments