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.
%I A272613 #12 May 04 2016 08:33:59 %S A272613 1,2,2,3,4,4,5,5,6,8,6,8,9,9,13,10,12,14,11,17,17,14,17,22,16,23,17, %T A272613 24,22,23,23,23,26,31,28,28,35,37,32,32,39,33,39,46,34,49,33,45,48,45, %U A272613 46,60,54,58,56,58,50,70,54,53,73,57,61,61,77,50,73,56,68,72 %N A272613 a(0)=1; thereafter a(n) = a(n-A272611(n)) + a(n-A272612(n)). %C A272613 This sequence exists as long as A272611 and A272612 exist. %C A272613 Empirically, this sequence appears to grow approximately like n^a for some a between 1 and 2. %H A272613 Nathan Fox, <a href="/A272613/b272613.txt">Table of n, a(n) for n = 0..10000</a> %p A272613 See A272611 for Maple code %Y A272613 Cf. A005185, A272610, A272611, A272612. %K A272613 nonn %O A272613 0,2 %A A272613 _Nathan Fox_, May 03 2016