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.

A088403 Duplicate of A077495.

Original entry on oeis.org

125, 25, 15, 5, 4, 3, 2, 1, 9, 8, 7, 6, 23, 22, 12, 11, 37, 36, 62, 61, 87, 86, 112, 111, 236
Offset: 1

Views

Author

Keywords

A069536 Smallest multiple of 8 with digit sum n.

Original entry on oeis.org

0, 1000, 200, 120, 40, 32, 24, 16, 8, 72, 64, 56, 48, 184, 176, 96, 88, 296, 288, 496, 488, 696, 688, 896, 888, 1888, 2888, 3888, 4888, 5888, 6888, 7888, 8888, 9888, 19888, 29888, 39888, 49888, 59888, 69888, 79888, 89888, 99888
Offset: 0

Views

Author

Amarnath Murthy, Apr 01 2002

Keywords

Comments

a(25) onwards the pattern is evident.

Crossrefs

Cf. A069521 to A069530, A069532, A069533, A069534, A069535.

Programs

  • Haskell
    a069536 n = a069536_list !! n
a069536_list = map (* 8) a077495_list
-- Reinhard Zumkeller, Dec 09 2011

Formula

a(n) = 8 * A077495(n).

Extensions

Missing a(0) inserted by Franklin T. Adams-Watters, Nov 29 2011
Showing 1-2 of 2 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.