login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A093684 In binary representation: number of occurrences of n in n!. 4
1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 3, 0, 1, 0, 2, 0, 1, 1, 1, 1, 2, 3, 2, 2, 2, 1, 1, 1, 3, 0, 2, 1, 3, 1, 1, 0, 1, 2, 2, 3, 3, 1, 1, 1, 1, 2, 2, 4, 3, 3, 3, 2, 2, 0, 3, 1, 5, 5, 6, 4, 1, 5, 2, 3, 2, 2, 4, 1, 1, 1, 4, 1, 1, 1, 2, 3, 3, 4, 5, 0, 3, 2, 1, 4, 3, 4, 5, 3, 2, 1, 2, 3, 3, 3, 3, 6, 2, 3, 4, 4, 2 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,12
COMMENTS
a(A093685(n)) = 0, a(A093686(n)) > 0.
LINKS
EXAMPLE
n=12->'1100', 12!=479001600->'11100100011001111110000000000' with three occurrences of '1100': '.1100....1100....1100........', therefore a(12)=3.
MAPLE
f:= proc(n) local L, Lf;
L:= convert(convert(n, binary), string);
Lf:= convert(convert(n!, binary), string);
nops([StringTools:-SearchAll(L, Lf)])
end proc:
map(f, [$1..100]); # Robert Israel, May 20 2016
MATHEMATICA
non[n_]:=Module[{b=IntegerDigits[n, 2], f=IntegerDigits[n!, 2]}, Length[ Select[ Partition[ f, Length[b], 1], #==b&]]]; Array[non, 110] (* Harvey P. Dale, Jun 04 2014 *)
CROSSREFS
Sequence in context: A216600 A356679 A356681 * A101270 A351097 A155522
KEYWORD
nonn
AUTHOR
Reinhard Zumkeller, Apr 10 2004
STATUS
approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 19 04:26 EDT 2024. Contains 370952 sequences. (Running on oeis4.)