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.

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

This page as a plain text file.
%I A200780 #14 Dec 24 2021 08:12:35
%S A200780 1,2,1,3,1,4,2,3,2,1,5,1,6,4,2,2,1,7,3,1,8,2,5,1,9,2,2,3,3,1,10,4,4,4,
%T A200780 1,11,5,5,6,6,1,12,5,1,13,6,1,14,7,8,3,1,15,7,2,1,16,3,1,17,9,2,1,18,
%U A200780 4,1,19,10,2,11,7,1,20,6,2,12,7,13,8,2,1,21,3,1,22,14,3,3,1,23,8,1,24,15,4,5,4
%N A200780 a(n) = number of i in the range 1 <= i <= n such that b(i)=b(n), where b is the sequence A181391 taken with offset 1.
%C A200780 Equivalently, this is the ORDINAL transform of Van Eck's sequence A181391. - _N. J. A. Sloane_, Apr 09 2020
%H A200780 Rémy Sigrist, <a href="/A200780/b200780.txt">Table of n, a(n) for n = 1..10000</a>
%H A200780 Rémy Sigrist, <a href="/A200780/a200780.txt">C++ program for A200780</a>
%p A200780 # The ORDINAL transform of a sequence a[0], a[1], a[2], ... is the sequence b[0], b[1], b[2], ... where b[n] is the number of times a[n] has occurred in [a[0], ..., a[n]].
%p A200780 ORDINAL:=proc(a)  local b,t1,tlist,clist,n,t,nt;
%p A200780 if whattype(a) <> list then RETURN([]); fi:
%p A200780 t1:=nops(a);
%p A200780 tlist:=[];
%p A200780 clist:=Array(1..t1,0);
%p A200780 b:=[]; nt:=0;
%p A200780 for n from 1 to t1 do t:=a[n];
%p A200780 if member(t,tlist,'p') then clist[p] := clist[p]+1; b:=[op(b),clist[p]];
%p A200780 else nt:=nt+1; tlist:=[op(tlist),t]; clist[nt]:=1; b:=[op(b),1]; fi;
%p A200780 od: b; end: # _N. J. A. Sloane_, Apr 09 2020
%p A200780 See also A200779.
%o A200780 (C++) See Links section.
%Y A200780 Cf. A181391.
%K A200780 nonn
%O A200780 1,2
%A A200780 _N. J. A. Sloane_, Nov 22 2011