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.

A055161 n has 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, 995544, 766431, 76664331, 98754210, 987654321, 999555444, 7666643331, 9876543210, 9987542100, 98766543321, 766666433331, 987665433210, 998765432100, 999875421000, 999955554444, 9876665433321
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. A055158.

Formula

a(n)= A055160(n)+A055162(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).

A055159 n has distinct 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).

Original entry on oeis.org

459, 1467, 1245789, 123456789, 123456789
Offset: 0

Views

Author

Henry Bottomley, Apr 27 2000

Keywords

Examples

			459=954-495
		

References

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

Crossrefs

Cf. A055162.

Formula

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