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.

Previous Showing 11-20 of 824 results. Next

A073327 Write U.S. English name for n (ignoring hyphens and spaces) and add numerical values of letters using a=1, b=2, ..., y=25, z=26.

Original entry on oeis.org

64, 34, 58, 56, 60, 42, 52, 65, 49, 42, 39, 63, 87, 99, 104, 65, 96, 109, 73, 86, 107, 141, 165, 163, 167, 149, 159, 172, 156, 149, 100, 134, 158, 156, 160, 142, 152, 165, 149, 142, 84, 118, 142, 140, 144, 126, 136, 149, 133, 126, 66, 100, 124, 122, 126, 108, 118
Offset: 0

Views

Author

Paul Lusch, Aug 22 2002

Keywords

Comments

In writing out the names for these numbers, "and" is not used in U.S. English; e.g., 101 is rendered as "one hundred one" rather than "one hundred and one". - Robert Israel, Jun 12 2019
The British English version is too similar to this to have its own entry. They first differ at n=101, where here a(101) = 142, whereas in British English 101 is "one hundred and one", which is 161. - N. J. A. Sloane, Jun 09 2021
From Robert Israel's data it appears that the U.S. version has no fixed points, and the British version has exactly two fixed points, at 251 and 259. I do not know if either version has cycles of length >= 2 apart from the cycles of length 5 that are visible in A345126 and A345157. - N. J. A. Sloane, Jun 11 2021

Examples

			"One" = 15 + 14 + 5 = 34 (o is 15th letter, n is 14th letter, e is 5th letter).
From _Omar E. Pol_, Jun 15 2021: (Start)
-----------------------------------------------------
   n      Name      Calculation                  a(n)
-----------------------------------------------------
   0      Zero      26 +  5 + 18 + 15           = 64
   1      One       15 + 14 +  5                = 34
   2      Two       20 + 23 + 15                = 58
   3      Three     20 +  8 + 18 +  5 +  5      = 56
   4      Four       6 + 15 + 21 + 18           = 60
   5      Five       6 +  9 + 22 +  5           = 42
   6      Six       19 +  9 + 24                = 52
   7      Seven     19 +  5 + 22 +  5 + 14      = 65
   8      Eight      5 +  9 +  7 +  8 + 20      = 49
   9      Nine      14 +  9 + 14 +  5           = 42
  10      Ten       20 +  5 + 14                = 39
  11      Eleven     5 + 12 +  5 + 22 +  5 + 14 = 63
  12      Twelve    20 + 23 +  5 + 12 + 22 +  5 = 87
... (End)
		

Crossrefs

Row sums of A073029.
For analogs in other languages see A169639 (French), A119945 (German), A161406 (Spanish).

Programs

  • Maple
    # Maple program for US English
    f:= proc(n) local S;
       uses StringTools;
      S:= Select(IsAlpha,convert(n,english));
      convert(map(`-`,convert(S,bytes),96),`+`)
    end proc:
    map(f, [$0..100]); # Robert Israel, Jun 12 2019
    # British English version, valid for n < 10^9
    f:= proc(n) local S;
       uses StringTools;
      S:= Select(IsAlpha, convert(n, english, And));
      convert(map(`-`, convert(S, bytes), 96), `+`)
    end proc:
    map(f, [$0..200]); # Robert Israel, Jun 11 2021
  • Mathematica
    a[n_] := Total@ Flatten[ ToCharacterCode@# - 96 & /@ Characters@ StringDelete[IntegerName@ n, Except@ LetterCharacter]] (* after Michael De Vlieger in A362065 *); Array[a, 57, 0] (* Robert G. Wilson v, Apr 19 2023 *)
  • PARI
    A073327(n)=sum(i=1,#n=select(t->t>64,Vec(Vecsmall(English(n)))),n[i]%32) \\ see A052360 for English(). - M. F. Hasler, Jun 22 2013
    
  • Python
    import re
    from num2words import num2words
    # US English
    def A073327(n): return sum(ord(d)-96 for d in re.sub(r"\sand\s|[^a-z]", "", num2words(n)))
    # British English
    def A073327(n): return sum(ord(d)-96 for d in re.sub("[^a-z]", "", num2words(n, lang='en_GB'))) # Chai Wah Wu, Jun 13 2021

Extensions

a(0) added by N. J. A. Sloane, Jun 30 2008
More terms from Jon E. Schoenfield, Aug 30 2009

A161390 Numbers with digits in alphabetical order (in Spanish).

Original entry on oeis.org

0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 11, 21, 22, 23, 26, 27, 28, 29, 31, 33, 41, 42, 43, 44, 46, 47, 48, 49, 51, 52, 53, 54, 55, 56, 57, 58, 59, 61, 63, 66, 67, 71, 73, 77, 81, 83, 86, 87, 88, 91, 93, 96, 97, 98, 99, 111, 211
Offset: 1

Views

Author

Claudio Meller, Jun 08 2009

Keywords

Comments

List of decimal digits, alphabetically sorted by their names in Spanish:
0 cero, 5 cinco, 4 cuatro, 2 dos, 9 nueve, 8 ocho, 6 seis, 7 siete, 3 tres, 1 uno/una. - Reinhard Zumkeller, Oct 05 2014
a(36233) = A247813(512) = 542986731 is the greatest term not containing any repeating digits. - Reinhard Zumkeller, Oct 05 2014

Crossrefs

Cf. A247813 (subsequence).
Cf. A247750 (Czech), A247751 (Danish), A247752 (Dutch), A053432 (English), A247753 (Finnish), A247754 (French), A247755 (German), A247756 (Hungarian), A247757 (Italian), A247758 (Latin), A247759 (Norwegian), A247760 (Polish), A247757 (Portuguese), A247761 (Russian), A247762 (Slovak), A247759 (Swedish), A247764 (Turkish).

Programs

  • Haskell
    import Data.IntSet (fromList, deleteFindMin, union)
    a161390 n = a161390_list !! (n-1)
    a161390_list = 0 : f (fromList [1..9]) where
       f s = x : f (s' `union`
             fromList (map (+ 10 * x) $ dropWhile (/= mod x 10) digs))
         where (x, s') = deleteFindMin s
       digs = [0, 5, 4, 2, 9, 8, 6, 7, 3, 1]
    -- Reinhard Zumkeller, Oct 18 2014
  • Perl
    sub isA161390 {
      shift =~ m/^(0|5*4*2*9*8*6*7*3*1*)$/
    }
    

A247758 Numbers in decimal representation, such that in Latin their digits are in alphabetic order.

Original entry on oeis.org

0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 33, 40, 41, 43, 44, 45, 46, 47, 50, 51, 53, 55, 56, 57, 60, 61, 63, 66, 67, 70, 71, 73, 77, 80, 81, 83, 84, 85, 86, 87, 88, 90, 91, 93, 94, 95, 96, 97, 98, 99, 100, 110
Offset: 1

Views

Author

Reinhard Zumkeller, Oct 05 2014

Keywords

Comments

List of decimal digits, alphabetically sorted by their names in Latin:
2 duo/duae/duo, 9 novem, 8 octo, 4 quattuor, 5 quinque, 6 sex, 7 septem, 3 tres/tria, 1 unus/una/unum, 0 zipherum;
a(131861) = A247808(1023) = 2984567310 is the greatest term not containing any repeating digits.

Crossrefs

Cf. A247808 (subsequence).
Cf. A247750 (Czech), A247751 (Danish), A247752 (Dutch), A053432 (English), A247753 (Finnish), A247754 (French), A247755 (German), A247756 (Hungarian), A247757 (Italian), A247759 (Norwegian), A247760 (Polish), A247757 (Portuguese), A247761 (Russian), A247762 (Slovak), A161390 (Spanish), A247759 (Swedish), A247764 (Turkish).

Programs

  • Haskell
    import Data.IntSet (fromList, deleteFindMin, union)
    a247758 n = a247758_list !! (n-1)
    a247758_list = 0 : f (fromList [1..9]) where
       f s = x : f (s' `union`
             fromList (map (+ 10 * x) $ dropWhile (/= mod x 10) digs))
         where (x, s') = deleteFindMin s
       digs = [2, 9, 8, 4, 5, 6, 7, 3, 1, 0]

A247802 Numbers in decimal representation with distinct digits, such that in Dutch their digits are in alphabetic order.

Original entry on oeis.org

0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 12, 13, 14, 15, 16, 17, 19, 24, 25, 26, 27, 30, 32, 34, 35, 36, 37, 39, 45, 46, 47, 56, 57, 67, 80, 81, 82, 83, 84, 85, 86, 87, 89, 90, 92, 94, 95, 96, 97, 102, 104, 105, 106, 107, 124, 125, 126, 127, 130, 132, 134, 135, 136
Offset: 1

Views

Author

Reinhard Zumkeller, Oct 05 2014

Keywords

Comments

List of decimal digits, alphabetically sorted by their names in Dutch:
8 acht, 1 een, 3 drie, 9 negen, 0 nul, 2 twee, 4 vier, 5 vijf, 6 zes, 7 zeven;
finite sequence with last and largest term a(992) = 8139024567.

Crossrefs

Intersection of A010784 and A247752.
Cf. A247800 (Czech), A247801 (Danish), A053433 (English), A247803 (Finnish), A247804 (French), A247805 (German), A247806 (Hungarian), A247807 (Italian), A247808 (Latin), A247809 (Norwegian), A247810 (Polish), A247807 (Portuguese), A247811 (Russian), A247812 (Slovak), A247813 (Spanish), A247809 (Swedish), A247814 (Turkish).

Programs

  • Haskell
    import Data.IntSet (fromList, deleteFindMin, union)
    import qualified Data.IntSet as Set (null)
    a247802 n = a247802_list !! (n-1)
    a247802_list = 0 : f (fromList [1..9]) where
       f s | Set.null s = []
           | otherwise  = x : f (s' `union`
             fromList (map (+ 10 * x) $ tail $ dropWhile (/= mod x 10) digs))
           where (x, s') = deleteFindMin s
       digs = [8, 1, 3, 9, 0, 2, 4, 5, 6, 7]

A247750 Numbers in decimal representation, such that in Czech their digits are in alphabetic order.

Original entry on oeis.org

0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 13, 15, 16, 17, 18, 20, 21, 22, 23, 25, 26, 27, 28, 33, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 53, 55, 56, 57, 63, 66, 73, 76, 77, 83, 85, 86, 87, 88, 90, 91, 92, 93, 95, 96, 97, 98, 99, 100, 103, 105, 106, 107, 108
Offset: 1

Views

Author

Reinhard Zumkeller, Oct 05 2014

Keywords

Comments

List of decimal digits, alphabetically sorted by their names in Czech:
4 čtyři, 9 devět, 2 dva/dvě, 1 jeden/jedna/jedno, 0 nula, 8 osm, 5 pět, 7 sedm, 6 šest, 3 tři;
a(144740) = A247800(992) = 4921085763 is the greatest term not containing any repeating digits.

Crossrefs

Cf. A247800 (subsequence).
Cf. A247751 (Danish), A247752 (Dutch), A053432 (English), A247753 (Finnish), A247754 (French), A247755 (German), A247756 (Hungarian), A247757 (Italian), A247758 (Latin), A247759 (Norwegian), A247760 (Polish), A247757 (Portuguese), A247761 (Russian), A247762 (Slovak), A161390 (Spanish), A247759 (Swedish), A247764 (Turkish).

Programs

  • Haskell
    import Data.IntSet (fromList, deleteFindMin, union)
    a247750 n = a247750_list !! (n-1)
    a247750_list = 0 : f (fromList [1..9]) where
       f s = x : f (s' `union`
             fromList (map (+ 10 * x) $ dropWhile (/= mod x 10) digs))
         where (x, s') = deleteFindMin s
       digs = [4, 9, 2, 1, 0, 8, 5, 7, 6, 3]

A247752 Numbers in decimal representation, such that in Dutch their digits are in alphabetic order.

Original entry on oeis.org

0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 19, 22, 24, 25, 26, 27, 30, 32, 33, 34, 35, 36, 37, 39, 44, 45, 46, 47, 55, 56, 57, 66, 67, 77, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 92, 94, 95, 96, 97, 99, 100, 102, 104, 105, 106, 107
Offset: 1

Views

Author

Reinhard Zumkeller, Oct 05 2014

Keywords

Comments

List of decimal digits, alphabetically sorted by their names in Dutch:
8 acht, 1 een, 3 drie, 9 negen, 0 nul, 2 twee, 4 vier, 5 vijf, 6 zes, 7 zeven;
a(137654) = A247802(992) = 8139024567 is the greatest term not containing any repeating digits.

Crossrefs

Cf. A247802 (subsequence).
Cf. A247750 (Czech), A247751 (Danish), A053432 (English), A247753 (Finnish), A247754 (French), A247755 (German), A247756 (Hungarian), A247757 (Italian), A247758 (Latin), A247759 (Norwegian), A247760 (Polish), A247757 (Portuguese), A247761 (Russian), A247762 (Slovak), A161390 (Spanish), A247759 (Swedish), A247764 (Turkish).

Programs

  • Haskell
    import Data.IntSet (fromList, deleteFindMin, union)
    a247752 n = a247752_list !! (n-1)
    a247752_list = 0 : f (fromList [1..9]) where
       f s = x : f (s' `union`
             fromList (map (+ 10 * x) $ dropWhile (/= mod x 10) digs))
         where (x, s') = deleteFindMin s
       digs = [8, 1, 3, 9, 0, 2, 4, 5, 6, 7]

A247753 Numbers in decimal representation, such that in Finnish their digits are in alphabetic order.

Original entry on oeis.org

0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 11, 20, 21, 22, 23, 24, 25, 26, 27, 29, 30, 31, 33, 34, 35, 36, 37, 39, 40, 41, 44, 45, 47, 49, 51, 55, 59, 60, 61, 64, 65, 66, 67, 69, 71, 75, 77, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 91, 99, 111, 200, 201, 205, 207, 209
Offset: 1

Views

Author

Reinhard Zumkeller, Oct 05 2014

Keywords

Comments

List of decimal digits, alphabetically sorted by their names in Finnish:
a(143982) = A247803(1008) = 8236407591 is the greatest term not containing any repeating digits.

Crossrefs

Cf. A247803 (subsequence).
Cf. A247750 (Czech), A247751 (Danish), A247752 (Dutch), A053432 (English), A247754 (French), A247755 (German), A247756 (Hungarian), A247757 (Italian), A247758 (Latin), A247759 (Norwegian), A247760 (Polish), A247757 (Portuguese), A247761 (Russian), A247762 (Slovak), A161390 (Spanish), A247759 (Swedish), A247764 (Turkish).

Programs

  • Haskell
    import Data.IntSet (fromList, deleteFindMin, union)
    a247753 n = a247753_list !! (n-1)
    a247753_list = 0 : f (fromList [1..9]) where
       f s = x : f (s' `union`
             fromList (map (+ 10 * x) $ dropWhile (/= mod x 10) digs))
         where (x, s') = deleteFindMin s
       digs = [8, 2, 3, 6, 4, 0, 7, 5, 9, 1]

A247754 Numbers in decimal representation, such that in French their digits are in alphabetic order.

Original entry on oeis.org

0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 20, 21, 22, 23, 24, 26, 27, 28, 29, 30, 31, 33, 40, 41, 43, 44, 46, 47, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 63, 66, 70, 71, 73, 76, 77, 80, 81, 83, 84, 86, 87, 88, 89, 90, 91, 93, 94, 96, 97, 99, 100, 110
Offset: 1

Views

Author

Reinhard Zumkeller, Oct 05 2014

Keywords

Comments

List of decimal digits, alphabetically sorted by their names in French:
5 cinq, 2 deux, 8 huit, 9 neuf, 4 quatre, 7 sept, 6 six, 3 trois, 1 un, 0 zéro;
a(129217) = A247804(1023) = 5289476310 is the greatest term not containing any repeating digits.

Crossrefs

Cf. A247804 (subsequence).
Cf. A247750 (Czech), A247751 (Danish), A247752 (Dutch), A053432 (English), A247753 (Finnish), A247755 (German), A247756 (Hungarian), A247757 (Italian), A247758 (Latin), A247759 (Norwegian), A247760 (Polish), A247757 (Portuguese), A247761 (Russian), A247762 (Slovak), A161390 (Spanish), A247759 (Swedish), A247764 (Turkish).

Programs

  • Haskell
    import Data.IntSet (fromList, deleteFindMin, union)
    a247754 n = a247754_list !! (n-1)
    a247754_list = 0 : f (fromList [1..9]) where
       f s = x : f (s' `union`
             fromList (map (+ 10 * x) $ dropWhile (/= mod x 10) digs))
         where (x, s') = deleteFindMin s
       digs = [5, 2, 8, 9, 4, 7, 6, 3, 1, 0]

A247755 Numbers in decimal representation, such that in German their digits are in alphabetic order.

Original entry on oeis.org

0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 14, 15, 16, 17, 19, 22, 30, 31, 32, 33, 34, 35, 36, 37, 39, 42, 44, 50, 52, 54, 55, 56, 57, 59, 62, 64, 66, 67, 72, 74, 77, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 92, 94, 96, 97, 99, 100, 102, 104, 106, 107, 110
Offset: 1

Views

Author

Reinhard Zumkeller, Oct 05 2014

Keywords

Comments

List of decimal digits, alphabetically sorted by their names in German:
8 acht, 3 drei, 1 eins, 5 fünf, 9 neun, 0 null, 6 sechs, 7 sieben, 4 vier, 2 zwei;
a(142055) = A247805(1008) = 8315906742 is the greatest term not containing any repeated digits.

Crossrefs

Cf. A247805 (subsequence).
Cf. A247750 (Czech), A247751 (Danish), A247752 (Dutch), A053432 (English), A247753 (Finnish), A247754 (French), A247756 (Hungarian), A247757 (Italian), A247758 (Latin), A247759 (Norwegian), A247760 (Polish), A247757 (Portuguese), A247761 (Russian), A247762 (Slovak), A161390 (Spanish), A247759 (Swedish), A247764 (Turkish).

Programs

  • Haskell
    import Data.IntSet (fromList, deleteFindMin, union)
    a247755 n = a247755_list !! (n-1)
    a247755_list = 0 : f (fromList [1..9]) where
       f s = x : f (s' `union`
             fromList (map (+ 10 * x) $ dropWhile (/= mod x 10) digs))
         where (x, s') = deleteFindMin s
       digs = [8, 3, 1, 5, 9, 0, 6, 7, 4, 2]

A247756 Numbers in decimal representation, such that in Hungarian their digits are in alphabetic order.

Original entry on oeis.org

0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 22, 24, 25, 28, 29, 30, 32, 33, 34, 35, 36, 37, 38, 39, 40, 44, 45, 48, 55, 60, 62, 64, 65, 66, 67, 68, 69, 70, 72, 74, 75, 77, 78, 79, 85, 88, 90, 94, 95, 98, 99, 100, 105, 108, 110
Offset: 1

Views

Author

Reinhard Zumkeller, Oct 05 2014

Keywords

Comments

List of decimal digits, alphabetically sorted by their names in Hungarian:
1 egy, 3 három, 6 hat, 7 hét, 2 kettő, 9 kilenc, 4 négy, 0 nulla, 8 nyolc, 5 öt.
a(127748) = A247806(1020) = 1367294085 is the greatest term not containing any repeating digits.

Crossrefs

Cf. A247806 (subsequence).
Cf. A247750 (Czech), A247751 (Danish), A247752 (Dutch), A053432 (English), A247753 (Finnish), A247754 (French), A247755 (German), A247757 (Italian), A247758 (Latin), A247759 (Norwegian), A247760 (Polish), A247757 (Portuguese), A247761 (Russian), A247762 (Slovak), A161390 (Spanish), A247759 (Swedish), A247764 (Turkish).

Programs

  • Haskell
    import Data.IntSet (fromList, deleteFindMin, union)
    a247756 n = a247756_list !! (n-1)
    a247756_list = 0 : f (fromList [1..9]) where
       f s = x : f (s' `union`
             fromList (map (+ 10 * x) $ dropWhile (/= mod x 10) digs))
         where (x, s') = deleteFindMin s
       digs = [1, 3, 6, 7, 2, 9, 4, 0, 8, 5]
Previous Showing 11-20 of 824 results. Next