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.

A248013 Numbers m such that A247796(m) = m.

Original entry on oeis.org

0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 19, 28, 29, 37, 38, 39, 46, 47, 48, 49, 55, 56, 57, 58, 59, 64, 65, 66, 67, 68, 69, 73, 74, 75, 76, 77, 78, 79, 82, 83, 84, 85, 86, 87, 88, 89, 91, 92, 93, 94, 95, 96, 97, 98, 99, 191, 192, 193, 194, 195, 196, 197, 198, 199, 282
Offset: 1

Views

Author

Reinhard Zumkeller, Oct 08 2014

Keywords

Comments

A247796(a(n)) = a(n);
numbers, containing no pair of adjacent digits with sum <= 9 in decimal representation.

Crossrefs

Cf. A248014 (complement).

Programs

  • Haskell
    a248013 n = a248013_list !! (n-1)
    a248013_list = filter (\x -> a247796 x == x) [0..]

A248014 Numbers m such that A247796(m) < m.

Original entry on oeis.org

10, 11, 12, 13, 14, 15, 16, 17, 18, 20, 21, 22, 23, 24, 25, 26, 27, 30, 31, 32, 33, 34, 35, 36, 40, 41, 42, 43, 44, 45, 50, 51, 52, 53, 54, 60, 61, 62, 63, 70, 71, 72, 80, 81, 90, 100, 101, 102, 103, 104, 105, 106, 107, 108, 109, 110, 111, 112, 113, 114, 115
Offset: 1

Views

Author

Reinhard Zumkeller, Oct 08 2014

Keywords

Comments

Numbers containing at least one pair of adjacent digits with sum <= 9 in decimal representation.

Crossrefs

Cf. A248013 (complement).

Programs

  • Haskell
    a248014 n = a248014_list !! (n-1)
    a248014_list = filter (\x -> a247796 x < x) [0..]

Formula

A247796(a(n)) < a(n).
A168046(a(n)) = 1. [Editor's note: This is obviously wrong. Certainly another sequence number was meant. Please edit or inform us if you find the correct reference.]
a(n) = A039691(n+10) up to a(64) = 118, but a(65) = 119 is not in A039691. - M. F. Hasler, Jan 26 2018
Showing 1-2 of 2 results.