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.

A348782 Records in A342585.

This page as a plain text file.
%I A348782 #27 Jun 28 2025 09:50:28
%S A348782 0,1,2,3,4,5,6,7,9,10,11,12,13,15,16,17,18,19,20,22,23,25,26,28,30,31,
%T A348782 32,33,35,37,39,40,41,44,45,47,50,52,55,56,57,58,59,60,62,64,67,69,70,
%U A348782 71,72,73,74,75,76,79,81,83,84,85,86,87,90,94,96,98,99,100,101,102,103,105,109,119,129
%N A348782 Records in A342585.
%C A348782 Although initially this contains most numbers, eventually the terms become sparse.
%C A348782 It would be nice to have an estimate for the upper envelope of the Inventory Sequence A342585 (that is, for a curve through the points with coordinates (A347305(n), a(n))).
%H A348782 Rémy Sigrist, <a href="/A348782/b348782.txt">Table of n, a(n) for n = 1..25000</a> (first 178 terms from N. J. A. Sloane)
%H A348782 Rémy Sigrist, <a href="/A348782/a348782.txt">C program for A348782</a>
%H A348782 <a href="/index/In#inventory">Index entries for sequences related to the inventory sequence</a>
%t A348782 j = r = c[_] = 0; {0}~Join~Reap[Do[k = 0; While[c[k] > 0, Set[m, c[k]]; c[m]++; k++; If[m > r, Sow@ Set[r, m]]]; Set[m, c[k]]; c[m]++, 85]][[-1, -1]] (* _Michael De Vlieger_, Nov 13 2021 *)
%o A348782 (C) // See Links section.
%Y A348782 Cf. A342585, A347305 (indices).
%K A348782 nonn
%O A348782 1,3
%A A348782 _N. J. A. Sloane_, Nov 13 2021