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.

A063892 a(1) = a(2) = a(3) = 1, a(n) = a(n-a(n-2))+a(n-a(n-3)) for n>3.

Original entry on oeis.org

1, 1, 1, 2, 4, 6, 5, 3, 3, 9, 6, 4, 7, 12, 9, 5, 7, 10, 16, 16, 10, 12, 12, 16, 14, 21, 13, 17, 8, 14, 24, 26, 19, 12, 8, 23, 22, 23, 12, 17, 18, 28, 35, 26, 16, 22, 34, 47, 22, 6, 10, 36, 69, 36
Offset: 1

Views

Author

Henry Bottomley, Aug 29 2001

Keywords

Comments

Undefined for n>54 since a(53)=69>=55.

Examples

			a(7) = a(7-a(5))+a(7-a(4)) = a(7-4)+a(7-2) = a(3)+a(5) = 1+4 = 5.
		

Crossrefs

See A064714 for a variant which does not die.

Programs

  • Maple
    #Q(r,s) with initial values 1,1,1,..., from N. J. A. Sloane, Apr 15 2014
    r:=2; s:=3;
    a:=proc(n) option remember; global r,s;
    if n <= s then 1
    else
        if (a(n-r) <= n) and (a(n-s) <= n) then
        a(n-a(n-r))+a(n-a(n-s));
        else lprint("died with n =",n); return (-1);
        fi;
    fi; end;
    [seq(a(n),n=1..54)];