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

 

Logo

The October issue of the Notices of the Amer. Math. Soc. has an article about the OEIS.

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

%I

%S 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,

%T 7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,

%U 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

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

%C The m in definition is given by A084558(n).

%C Sequence consists of numbers 0..A001563(n)-1 followed by numbers 0..A001563(n+1)-1, and so on. - _Antti Karttunen_, Dec 17 2012

%H A. Karttunen, <a href="/A212598/b212598.txt">Table of n, a(n) for n = 1..5040</a>

%F a(n) = n-A000142(A084558(n)). - _Antti Karttunen_, Dec 17 2012

%p f:=proc(n) local i; for i from 0 to n do if i! > n then break; fi; od; n-(i-1)!; end;

%p [seq(f(n),n=1..70)];

%o (Scheme): (define (A212598 n) (- n (A000142 (A084558 n))))

%o (PARI) a(n)=my(m); while(m++!<=n,); n-(m-1)! \\ _Charles R Greathouse IV_, Sep 02 2015

%Y Cf. A136437, A212266, A220656.

%K nonn

%O 1,4

%A _N. J. A. Sloane_, May 22 2012

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 September 25 11:05 EDT 2018. Contains 315389 sequences. (Running on oeis4.)