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.

A095777 Number of terms generated for n in increasing bases starting at 2 until the last term with only decimal digits is reached, or 0 where the number of such terms would be infinite (n<10).

Original entry on oeis.org

0, 0, 0, 0, 0, 0, 0, 0, 0, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 9, 10, 10, 11, 11, 12, 12, 13, 13, 14, 14, 9, 15, 10, 10, 11, 11, 11, 12, 12, 12, 13, 9, 13, 14, 10, 10, 15, 11, 11, 11, 12, 12, 9, 12, 13, 13, 10, 10, 14, 14, 11, 11, 11, 9, 12, 12, 12, 12, 10, 10, 13, 13, 13, 11
Offset: 1

Views

Author

Chuck Seggelin (seqfan(AT)plastereddragon.com), Jun 05 2004

Keywords

Examples

			a(30)=14 because 30 can be expressed in 14 successive bases (that is, bases 2 through 15) with no non-decimal digits as follows: 11110, 1010, 132, 110, 50, 42, 36, 33, 30, 28, 26, 24, 22, 20. In base 16, 30 is 1A.
		

Programs

  • Maple
    S := []; for n from 1 to 200 do; if 1>0 then; ct := 0; ok := true; b := 2; if (n>9) then; while ok=true do; L := convert(n, base, b); for e in L while ok=true do; if (e > 9) then ok:=false; fi; od; if ok=true then; ct := ct + 1; b := b + 1; fi; od; fi; S := [op(S), ct]; fi; od; S;