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.

A029722 Smallest positive integer containing the n-th letter of the alphabet (in US English), or -1 if no such integer exists.

This page as a plain text file.
%I A029722 #36 Jul 08 2025 19:18:35
%S A029722 1000,1000000000,1000000000000000000000000000,100,1,4,8,3,5,-1,-1,11,
%T A029722 1000000,1,1,1000000000000000000000000,1000000000000000,3,6,2,4,5,2,6,
%U A029722 20,-1
%N A029722 Smallest positive integer containing the n-th letter of the alphabet (in US English), or -1 if no such integer exists.
%C A029722 This uses the short scale for the names of large numbers. - _Ken Takusagawa_, Oct 11 2016
%C A029722 In British English, a(1) is 101. - _Paul Duckett_, Apr 23 2022
%H A029722 Jeff Miller, <a href="http://jeff560.tripod.com/words15.html"> A Collection of Word Oddities and Trivia</a>
%e A029722 C first occurs in "octillion".
%t A029722 alphabet={"a","b","c","d","e","f","g","h","i","j","k","l","m","n","o","p","q","r","s","t","u","v","w","x","y","z"};
%t A029722 candidates=AppendTo[AppendTo[Range[19],Table[10*i,{i,2,10}]],Table[10^i,{i,3,63,3}]]//Flatten//Quiet;
%t A029722 f[10]=f[11]=f[26]=-1; f[n_]:=Module[{k=1},
%t A029722 While[StringContainsQ[ToString[IntegerName[candidates[[k]],"Words"]],alphabet[[n]]]!=True,k++];candidates[[k]]];
%t A029722 f/@Range[26] (* _Ivan N. Ianakiev_, Apr 10 2018 *)
%Y A029722 Differs from A111098 because "zero" is not permitted.
%Y A029722 Cf. A114181.
%K A029722 fini,sign,full,word
%O A029722 1,1
%A A029722 Anonymous submission
%E A029722 a(5) corrected by _Donovan Johnson_, Dec 08 2004
%E A029722 Edited: Definition extended, "octillian" corrected, link and cross-reference provided; and sequence completed by _Rick L. Shepherd_, Aug 29 2009
%E A029722 Definition clarified by _Paul Duckett_, Apr 23 2022