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.

Showing 1-2 of 2 results.

A221715 Start of n-th doubling run in A114183.

Original entry on oeis.org

1, 5, 3, 9, 33, 11, 13, 7, 21, 25, 20, 17, 23, 19, 49, 39, 35, 47, 27, 29, 15, 43, 37, 97, 55, 41, 51, 57, 85, 73, 193, 111, 59, 61, 31, 89, 53, 329, 145, 192, 221, 237, 87, 105, 81, 101, 113, 481, 175, 149, 69, 93, 77, 99, 79, 71, 67, 65, 45, 75, 195, 157, 141, 189, 109, 83, 103, 229, 121, 352, 849, 233, 345, 297, 137, 187, 309, 281, 379, 155, 199, 159
Offset: 1

Views

Author

N. J. A. Sloane, Jan 27 2013

Keywords

Crossrefs

Programs

  • Maple
    # A114181
    M:=10000; M2:=1000;
    s1:={1}; v0:=[1]; v1:=[1]; v2:=[]; vi:=Array(1..M2);
    t1:=1; r1:=1; vi[1]:=1;
    for n from 2 to M do
    t2:=floor(sqrt(t1));
    if t2 in s1 then
       v0:=[op(v0),2*t1]; s1:={op(s1),2*t1}; r1:=r1+1; t1:=2*t1;
       if t1<=M2 then vi[t1]:=n; fi;
    else
       v0:=[op(v0),t2]; s1:={op(s1),t2}; v1:=[op(v1),t2]; v2:=[op(v2),r1]; r1:=1; t1:=t2;
       if t1<=M2 then vi[t1]:=n; fi;
    fi;
    od:
    # A114183:
    [seq(v0[i],i=1..nops(v0))];
    # A221715:
    [seq(v1[i],i=1..nops(v1))];
    # A221716:
    [seq(v2[i],i=1..nops(v2))];
    # A189419:
    [seq(vi[i],i=1..M2)];

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

Original entry on oeis.org

1000, 1000000000, 1000000000000000000000000000, 100, 1, 4, 8, 3, 5, -1, -1, 11, 1000000, 1, 1, 1000000000000000000000000, 1000000000000000, 3, 6, 2, 4, 5, 2, 6, 20, -1
Offset: 1

Views

Author

Anonymous submission

Keywords

Comments

This uses the short scale for the names of large numbers. - Ken Takusagawa, Oct 11 2016
In British English, a(1) is 101. - Paul Duckett, Apr 23 2022

Examples

			C first occurs in "octillion".
		

Crossrefs

Differs from A111098 because "zero" is not permitted.
Cf. A114181.

Programs

  • Mathematica
    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"};
    candidates=AppendTo[AppendTo[Range[19],Table[10*i,{i,2,10}]],Table[10^i,{i,3,63,3}]]//Flatten//Quiet;
    f[10]=f[11]=f[26]=-1; f[n_]:=Module[{k=1},
    While[StringContainsQ[ToString[IntegerName[candidates[[k]],"Words"]],alphabet[[n]]]!=True,k++];candidates[[k]]];
    f/@Range[26] (* Ivan N. Ianakiev, Apr 10 2018 *)

Extensions

a(5) corrected by Donovan Johnson, Dec 08 2004
Edited: Definition extended, "octillian" corrected, link and cross-reference provided; and sequence completed by Rick L. Shepherd, Aug 29 2009
Definition clarified by Paul Duckett, Apr 23 2022
Showing 1-2 of 2 results.