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.

A212598 a(n) = n - m!, where m is the largest number such that m! <= n.

Original entry on oeis.org

0, 0, 1, 2, 3, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66
Offset: 1

Views

Author

N. J. A. Sloane, May 22 2012

Keywords

Comments

The m in definition is given by A084558(n).
Sequence consists of numbers 0..A001563(n)-1 followed by numbers 0..A001563(n+1)-1, and so on. - Antti Karttunen, Dec 17 2012

Crossrefs

Programs

  • Maple
    f:=proc(n) local i; for i from 0 to n do if i! > n then break; fi; od; n-(i-1)!; end;
    [seq(f(n),n=1..70)];
  • PARI
    a(n)=my(m); while(m++!<=n,); n-(m-1)! \\ Charles R Greathouse IV, Sep 02 2015
  • Scheme
    (define (A212598 n) (- n (A000142 (A084558 n))))
    

Formula

a(n) = n-A000142(A084558(n)). - Antti Karttunen, Dec 17 2012