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.

A233188 a(n) is the least number not smaller than the total number of letters in the German names for all terms up to and including a(n).

This page as a plain text file.
%I A233188 #9 Dec 23 2024 14:53:43
%S A233188 4,8,11,19,30,40,48,60,68,80,89,100,117,140,158,180,199,218,240,260,
%T A233188 279,300,305,330,348,370,390,400,410,430,450,470,489,500,519,540,560,
%U A233188 580,598,618,640,660,680,700,705,730,750,770,790,800,811,830,850,870,889,900,919,940,960,980,998,1011,1030,1050,1069,1090,1110
%N A233188 a(n) is the least number not smaller than the total number of letters in the German names for all terms up to and including a(n).
%C A233188 See A233187 for a variant using strict inequality, "larger" instead of "not smaller", in the definition. See A233184 and A233185 for related English and French versions.
%H A233188 E. Angelini, <a href="https://web.archive.org/web/*/http://list.seqfan.eu/oldermail/seqfan/2013-December/012058.html">Cumulative quantity of letters used in a list of English number-names</a>, SeqFan list, Dec 05 2013
%o A233188 (PARI) a=0;k=0;for(n=1,99,until( k++ > a + A007208(k),); print1(k,","); a+=A007208(k))
%K A233188 nonn,word
%O A233188 1,1
%A A233188 _Eric Angelini_ and _M. F. Hasler_, Dec 05 2013