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.

A240832 Sequence R(n) arising from analysis of structure of A240830.

Original entry on oeis.org

0, 1, 2, 3, 4, 5, 6, 7, 2, 3, 4, 5, 6, 7, 8, 3, 4, 5, 6, 7, 8, 3, 10, 5, 6, 7, 8, 3, 10, 5, 12, 7, 8, 3, 10, 5, 12, 7, 14, 9, 10, 5, 12, 7, 14, 9, 10, 11, 12, 7, 14, 9, 10, 11, 12, 13, 14, 9, 10, 11, 12, 13, 14, 15, 10, 11, 12, 13, 14, 15, 10, 17, 12, 13, 14, 15, 10, 17, 12, 19, 14, 15, 10, 17, 12, 19, 14, 21, 10, 17
Offset: 1

Views

Author

N. J. A. Sloane, Apr 16 2014

Keywords

Crossrefs

Programs

  • Maple
    #T_s,k(n) from Callaghan et al. Eq. (2.2).
    s:=0; k:=7;
    T:=proc(n) option remember; global R,U,s,k; # A240830
    if n <= s+k then 1
    else
    add(U(n-i),i=0..k-1);
    fi; end;
    U:=proc(n) option remember; global R,T,s,k; # A240831
    T(R(n)); end;
    R:=proc(n) option remember; global U,T,s,k; # A240832
    n-s-T(n-1); end;
    t1:=[seq(R(n),n=1..100)];
  • Mathematica
    A240830[n_]:=A240830[n]=If[n<=7,1,Sum[A240830[A240832[n-i]],{i,0,6}]];
    A240832[n_]:=A240832[n]=n-A240830[n-1];
    Array[A240832,100] (* Paolo Xausa, Dec 06 2023, after N. J. A. Sloane *)