A303219 a(n) = n for n <= 11. Thereafter a(n) = a(n-a(n-2)) + a(n-a(n-4)) + a(n-a(n-6)).

1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 12, 12, 13, 14, 15, 16, 17, 18, 18, 18, 19, 20, 21, 22, 23, 24, 24, 24, 25, 26, 27, 28, 29, 30, 30, 30, 31, 32, 33, 34, 34, 34, 35, 36, 36, 36, 37, 38, 39, 40, 41, 42, 42, 42, 43, 44, 45, 46, 47, 48, 48, 48, 49, 50, 51, 52, 52, 52, 53, 54, 54, 54, 55, 56

Offset

1,2

Comments

Let a_i(n) = n for n <= 6*i - 1. Thereafter a_i(n) = a_i(n-a_i(n-i)) + a_i(n-a_i(n-2*i)) + a_i(n-a_i(n-3*i)). This sequence is a_2(n).

Links

Altug Alkan, Table of n, a(n) for n = 1..10000

Nathan Fox, A Slow Relative of Hofstadter's Q-Sequence, arXiv preprint arXiv:1611.08244 [math.NT], 2016.

A. Isgur, R. Lech, S. Moore, S. Tanny, Y. Verberne, and Y. Zhang, Constructing New Families of Nested Recursions with Slow Solutions, SIAM J. Discrete Math., 30(2), 2016, 1128-1147. (20 pages); DOI:10.1137/15M1040505

Mathematica

nmax = 100;
q[_] = 0; For[n = 1, n <= 11, n++, q[n] = n]; For[n = 12, n <= nmax, n++, q[n] = q[n - q[n-2]] + q[n - q[n-4]] + q[n - q[n-6]]]; Array[q, nmax] (* Jean-François Alcover, Feb 18 2019, from PARI *)

Prog

(PARI) q=vector(100); for(n=1, 11, q[n]=n); for(n=12, #q, q[n] = q[n-q[n-2]] + q[n-q[n-4]] + q[n-q[n-6]]); q
(GAP) a:=List([1..11], i->i);; for n in [12..100] do a[n]:=a[n-a[n-2]]+a[n-a[n-4]]+a[n-a[n-6]]; od; a; # Muniru A Asiru, May 19 2018
(Magma)  [n le 11 select n else Self(n-Self(n-2))+Self(n-Self(n-4))+Self(n-Self(n-6)): n in [1..70]]; // Vincenzo Librandi, May 20 2018

Crossrefs

Cf. A278055.

Sequence in context: A304232 A377293 A357030 * A071523 A297244 A070696

Adjacent sequences: A303216 A303217 A303218 * A303220 A303221 A303222

Keyword

nonn

Author

Altug Alkan, May 17 2018

Status

approved