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.

A008537 Numbers that do not contain the letter 'n'.

Original entry on oeis.org

0, 2, 3, 4, 5, 6, 8, 12, 30, 32, 33, 34, 35, 36, 38, 40, 42, 43, 44, 45, 46, 48, 50, 52, 53, 54, 55, 56, 58, 60, 62, 63, 64, 65, 66, 68, 80, 82, 83, 84, 85, 86, 88
Offset: 1

Views

Author

Keywords

Comments

From M. F. Hasler, Apr 01 2019: (Start)
This sequence contains 42 nonzero terms below 10^9, plus the initial a(1) = 0.
Since "hundred", "thousand", "million" etc. are forbidden, the only way to extend the sequence would be to use long scale with "milliard" for 10^9: then the next term would be a(44) = 2*10^9 = "two milliards", a(45) = 2*10^9 + 2, and so on.
The 2019 "April Fools contest" on codeforces.com referred to these numbers as "Kanban numbers", i.e., numbers which ban the letters 'k', 'a' and 'n'. But no 'k' ever appears, and unless we consider "milliard", 'a' only appears (in "thousand" and later "quadrillion") in conjunction with 'n', which therefore is the only relevant. So "n-ban (or maybe: anban) numbers" would be more a adequate name. (End)

Crossrefs

Cf. A006933 (eban numbers: without 'e'), A089589 (without 'i'), A008521 (without 'o'), A089590 (without 'u'), A008523 (without 't'), A072956 (turban numbers: without r, t or u), A072957 (urban numbers: without r or u).

Programs

  • PARI
    is(n)=!setsearch(Set(Vec(English(n))),"n") \\ See A052360 for English(). - M. F. Hasler, Apr 01 2019
    
  • Python
    from num2words import num2words
    afull = [k for k in range(100) if "n" not in num2words(k)]
    print(afull) # Michael S. Branicky, Aug 18 2022

Extensions

Edited by M. F. Hasler, Apr 01 2019