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.

A200779 a(n) = number of i in the range 1 <= i <= n such that b(i)=b(n), where b is the sequence A053615 taken with offset 1.

Original entry on oeis.org

1, 1, 2, 2, 1, 3, 3, 4, 2, 1, 3, 5, 4, 6, 4, 2, 1, 3, 5, 7, 5, 8, 6, 4, 2, 1, 3, 5, 7, 9, 6, 10, 8, 6, 4, 2, 1, 3, 5, 7, 9, 11, 7, 12, 10, 8, 6, 4, 2, 1, 3, 5, 7, 9, 11, 13, 8, 14, 12, 10, 8, 6, 4, 2, 1, 3, 5, 7, 9, 11, 13, 15, 9, 16, 14, 12, 10, 8, 6, 4, 2, 1, 3, 5, 7, 9, 11, 13, 15, 17, 10, 18, 16, 14, 12, 10, 8, 6, 4, 2, 1, 3, 5, 7
Offset: 1

Views

Author

N. J. A. Sloane, Nov 22 2011

Keywords

Comments

This assumes that the word "digit" in the definition in the Wimblik web page is changed to "number".

Programs

  • Maple
    # b[n] = number of i <= n such that a[i]=a[n].
    FREQ:=proc(a)  local b,i,c,n,t1:
    if whattype(a) <> list then RETURN([]); fi:
    b:=[];
    for n from 1 to nops(a) do
    c:=0; t1:=a[n];
    for i from 1 to n do if a[i]=t1 then c:=c+1; fi; od:
    b:=[op(b),c];
    od;
    RETURN(b);
    end:
    # read A053615 as a list called s1
    FREQ(s1);