cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A287643 a(1) = ... = a(6) = 1; a(n) = a(a(n-3)) + a(n-a(n-6)) for n > 6.

This page as a plain text file.
%I A287643 #8 May 31 2017 22:59:04
%S A287643 1,1,1,1,1,1,2,3,4,5,6,7,7,7,8,8,8,9,10,10,11,12,13,14,15,15,15,16,16,
%T A287643 16,16,16,17,17,18,18,19,21,21,23,24,25,27,27,29,28,28,29,28,29,28,30,
%U A287643 31,31,31,31,32,32,32,32,32,32,32,32,33,33,34,35,36,38,39,39,42,42,42,46,46
%N A287643 a(1) = ... = a(6) = 1; a(n) = a(a(n-3)) + a(n-a(n-6)) for n > 6.
%C A287643 This sequence has similar generational structure with A284511. Up to 2^20 see the plot of a(n) - A284511(n) in links section.
%H A287643 Altug Alkan, <a href="/A287643/b287643.txt">Table of n, a(n) for n = 1..10000</a>
%H A287643 Altug Alkan, <a href="/A287643/a287643.png">Scatterplot of a(n) - A284511(n)</a>
%o A287643 (PARI) q=vector(2^10);q[1]=q[2]=q[3]=q[4]=q[5]=q[6]=1; for(n=7, #q, q[n]=q[q[n-3]]+q[n-q[n-6]]); vector(2^10, n, q[n])
%Y A287643 Cf. A004001, A005185, A284511.
%K A287643 nonn
%O A287643 1,7
%A A287643 _Altug Alkan_, May 29 2017