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-3 of 3 results.

A055162 The number n has digits in ascending order and n=a-b where a has the digits of n in descending order and b has the digits of n in another order (a and b perhaps with extra zeros), ordered by a.

Original entry on oeis.org

459, 1467, 445599, 134667, 13346667, 1245789, 123456789, 444555999, 1333466667, 123456789, 12457899, 12334566789, 133334666667, 12334566789, 1234567899, 124578999, 444455559999, 1233345666789
Offset: 1

Views

Author

Henry Bottomley, Apr 27 2000

Keywords

Comments

Each term of this sequence A055162(n) corresponds to A099009(n+1), with its digits being reordered in the ascending manner. - Alexander R. Povolotsky, Apr 26 2012
All terms of this sequence are divisible by nine, yielding 51, 163, 49511, 14963, 1482963,.... - Alexander R. Povolotsky, Apr 29 2012

Examples

			459 = 954 - 495.
		

References

  • Denis Borris, Ken Duisenberg's Puzzle of the Week, April 20, 2000

Crossrefs

Formula

a(n) = A055161(n) - A055160(n).

A055157 n has distinct digits and n=a-b where a has the digits of n in descending order and b has the digits of n in ascending order (perhaps with leading zeros).

Original entry on oeis.org

495, 6174, 97508421, 864197532, 9753086421
Offset: 0

Views

Author

Henry Bottomley, Apr 27 2000

Keywords

Examples

			495 = 954-459.
		

Crossrefs

Formula

a(n) = A055158(n) - A055159(n).

A055158 n has distinct digits in descending order and n=a+b where a has the digits of n in another order and b has the digits of n in ascending order (perhaps with leading zeros).

Original entry on oeis.org

954, 7641, 98754210, 987654321, 9876543210
Offset: 0

Views

Author

Henry Bottomley, Apr 27 2000

Keywords

Examples

			954=495+459
		

References

  • Denis Borris, Ken Duisenberg's Puzzle of the Week, April 20, 2000

Crossrefs

Cf. A055161.

Formula

a(n)= A055157(n)+A055159(n)
Showing 1-3 of 3 results.