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.

A098750 a(n+1) = a(n) + 10's complement of first digit of a(n); a(0) = 0.

Original entry on oeis.org

0, 10, 19, 28, 36, 43, 49, 55, 60, 64, 68, 72, 75, 78, 81, 83, 85, 87, 89, 91, 92, 93, 94, 95, 96, 97, 98, 99, 100, 109, 118, 127, 136, 145, 154, 163, 172, 181, 190, 199, 208, 216, 224, 232, 240, 248, 256, 264, 272, 280, 288, 296, 304, 311, 318, 325, 332, 339, 346
Offset: 0

Views

Author

Eric Angelini, Oct 01 2004

Keywords

Comments

0 -> 10 because 0 + (10 - 0) = 10; 10 -> 19 because 10 + (10 - 1) = 19; 19 -> 28 because 19 + (10 - 1) = 28; 28 -> 36 because 28 + (10 - 2) = 36...
The number of entries between m*10^k and (m+1)*10^k is approximately (10^k)/(10-m) (for 0Sam Alexander, Jan 06 2005

Programs

  • Mathematica
    NestList[#+(10-First[IntegerDigits[#]])&,0,60] (* Harvey P. Dale, Oct 04 2012 *)

Extensions

More terms from Sam Alexander, Jan 06 2005