The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation. Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A287118 Numbers k such that A284644(k) = A284644(k-1) = A284644(k-2) = A284644(k-3). 0
 84, 172, 348, 700, 1404, 2720, 2754, 5448, 10904, 21816, 43640, 87288 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS For the first twelve terms of this sequence, corresponding values of A284644(k) are 11*2^2, 11*2^3, 11*2^4, 11*2^5, 11*2^6, 11*31*2^2, 3*5*23*2^2, 11*31*2^3, 11*31*2^4, 11*31*2^5, 11*31*2^6, 11*31*2^7 and k - A284644(k) are 40, 84, 172, 348, 700, 1356, 1374, 2720, 5448, 10904, 21816, 43640. Additionally, a(n) = 2*a(n-1) + 4 for 1 < n < 6 and a(n) = 2*a(n-1) + 8 for 8 < n < 13. In fact, also 5448 = 2720*2 + 8 but there is a(7) = 2754 between 2720 and 5448. In other words, we can partition sequence up to 10^5 as three subsequences: {84, 172, 348, 700, 1404}, {2754}, {2720, 5448, 10904, 21816, 43640, 87288} in order to see curious recursive patterns. If a(13) exists, it must be greater than 7.5*10^9. - Hans Havermann, May 27 2017 LINKS Altug Alkan, Nathan Fox, and Orhan Ozgur Aybar, On Hofstadter Heart Sequences, Complexity, 2017. PROG (PARI) q=vector(10^8); q=q=2; q=1; for(n=4, #q, q[n]=q[n-q[n-1]]+q[n-q[n-2]]); for (k=3, 10^8, if(q[k] == q[k-1] && q[k] == q[k-2] && q[k] == q[k-3], print1(k, ", "))); CROSSREFS Cf. A284644. Sequence in context: A273018 A260705 A295596 * A306514 A044416 A044797 Adjacent sequences:  A287115 A287116 A287117 * A287119 A287120 A287121 KEYWORD nonn,more AUTHOR Altug Alkan, following a suggestion from Nathan Fox, May 24 2017 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.

Last modified October 24 18:08 EDT 2021. Contains 348233 sequences. (Running on oeis4.)