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

A259043 a(n) = if n < 10 then n else a(floor(n/10) + n mod 10) + n mod 10.

Original entry on oeis.org

0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 1, 3, 5, 7, 9, 11, 13, 15, 17, 10, 2, 4, 6, 8, 10, 12, 14, 16, 9, 12, 3, 5, 7, 9, 11, 13, 15, 8, 11, 14, 4, 6, 8, 10, 12, 14, 7, 10, 13, 16, 5, 7, 9, 11, 13, 6, 9, 12, 15, 18, 6, 8, 10, 12, 5, 8, 11, 14, 17, 20, 7, 9, 11, 4, 7
Offset: 0

Views

Author

Reinhard Zumkeller, Jun 17 2015

Keywords

Comments

a(A259046(n)) = n and a(m) != n for m < A259046(n).

Links

Crossrefs

Cf. A076314, A007953, A008687, A259046.

Programs

  • Haskell
    a259043 x = if x < 10 then x else a259043 (x' + d) + d
            where (x', d) = divMod x 10
  • PARI
    a(n) = if (n<10, n, my(u=n%10); a(n\10 + u) + u); \\ Michel Marcus, Jan 23 2022

A358012 Minimal number of coins needed to pay n cents using coins of denominations 1 and 5 cents.

Original entry on oeis.org

0, 1, 2, 3, 4, 1, 2, 3, 4, 5, 2, 3, 4, 5, 6, 3, 4, 5, 6, 7, 4, 5, 6, 7, 8, 5, 6, 7, 8, 9, 6, 7, 8, 9, 10, 7, 8, 9, 10, 11, 8, 9, 10, 11, 12, 9, 10, 11, 12, 13, 10, 11, 12, 13, 14, 11, 12, 13, 14, 15, 12, 13, 14, 15, 16, 13, 14, 15, 16, 17, 14, 15, 16, 17, 18, 15, 16
Offset: 0

Views

Author

Sandra Snan, Oct 24 2022

Keywords

Comments

Sequence consists of runs of five consecutive integers: 0..4, 1..5, 2..6, 3..7, etc.

Links

Crossrefs

Cf. A002266, A010874.
Cf. A076314 (1,10 cents), A053344 (1,5,10,25 cents).

Programs

Formula

Sum of quotient and remainder of n/5.
a(n) = A002266(n) + A010874(n).
Previous Showing 11-12 of 12 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.