This site is supported by donations to The OEIS Foundation.

 Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing. Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A265333 Characteristic function for A265334: a(n) = 1 if n >= k! but < 2*k! for some k, 0 otherwise. 4
 0, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0 COMMENTS a(n) = 1 if the initial digit in factorial base representation (A007623) of n is 1, 0 otherwise. a(n) = 1 if A099563(n) = 1, 0 otherwise. LINKS Antti Karttunen, Table of n, a(n) for n = 0..10080 PROG (Scheme) (define (A265333 n) (if (zero? n) n (let loop ((f 1) (i 2)) (let ((nextf (* i f))) (if (> nextf n) (if (< n (* 2 f)) 1 0) (loop nextf (+ 1 i))))))) CROSSREFS Cf. A007623, A265334. Cf. also A099563. Sequence in context: A284935 A118249 A174206 * A159637 A095076 A285080 Adjacent sequences:  A265330 A265331 A265332 * A265334 A265335 A265336 KEYWORD nonn AUTHOR Antti Karttunen, Dec 25 2015 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
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified December 9 22:27 EST 2019. Contains 329880 sequences. (Running on oeis4.)