login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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 (list; graph; refs; listen; history; text; internal format)
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

A. Karttunen, Table of n, a(n) for n = 1..5040

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

Cf. A136437, A212266, A220656.

Sequence in context: A278164 A279681 A053645 * A274650 A294648 A170899

Adjacent sequences:  A212595 A212596 A212597 * A212599 A212600 A212601

KEYWORD

nonn

AUTHOR

N. J. A. Sloane, May 22 2012

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy .

Last modified June 21 21:17 EDT 2018. Contains 305640 sequences. (Running on oeis4.)