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.

A134679 a(1) = ... = a(6) = 1; a(n)=a(n-a(n-1))+a(n-a(n-6)).

This page as a plain text file.
%I A134679 #12 Apr 18 2014 16:03:36
%S A134679 1,1,1,1,1,1,2,3,4,5,6,7,7,8,8,9,9,10,11,11,12,12,14,13,15,14,15,16,
%T A134679 15,17,17,18,18,19,20,20,20,21,22,22,23,23,25,25,25,25,25,29,24,29,26,
%U A134679 29,29,30,32,28,32,29,34,31,32,36,32,38,32,39,36,36,38,36,42,35,41,39,40
%N A134679 a(1) = ... = a(6) = 1; a(n)=a(n-a(n-1))+a(n-a(n-6)).
%C A134679 The sequence dies after 2354 terms. - _N. J. A. Sloane_, Apr 15 2014
%H A134679 T. D. Noe, <a href="/A134679/b134679.txt">Table of n, a(n) for n = 1..2354</a> (complete sequence)
%t A134679 Clear[a]; a[n_] := a[n] = If[n<=6, 1, a[n-a[n-1]]+a[n-a[n-6]]]; t={1}; n=2; While[n<10000 && a[n-1]<n, AppendTo[t,a[n]]; n++ ]; t
%Y A134679 Cf. A132172.
%K A134679 nonn,fini
%O A134679 1,7
%A A134679 _T. D. Noe_, Nov 06 2007