Nothing Special   »   [go: up one dir, main page]

login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A212598
a(n) = n - m!, where m is the largest number such that m! <= n.
6
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,4
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
LINKS
FORMULA
a(n) = n-A000142(A084558(n)). - Antti Karttunen, Dec 17 2012
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)];
PROG
(Scheme): (define (A212598 n) (- n (A000142 (A084558 n))))
(PARI) a(n)=my(m); while(m++!<=n, ); n-(m-1)! \\ Charles R Greathouse IV, Sep 02 2015
CROSSREFS
KEYWORD
nonn
AUTHOR
N. J. A. Sloane, May 22 2012
STATUS
approved