Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A064394
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A064394
%S A064394 4,5,8,9,22,23,26,27,32,33,50,51,56,57,70,71,76,77,82,83,94,95,100,101,
%T A064394 112,113,118,119,128,129,134,135,176,177,186,187,196,197,266,267,274,
%U A064394 275,280,281,296,297,342,343,352,353,358,359,364,365,372,373,386,387
%N A064394 Exponent of highest power of 2 dividing n! equals the largest prime < 
               n.
%C A064394 [n/2]+[n/4]+[n/8]+[n/16]+... = prevprime(n).
%e A064394 8!=2^7*3^2*5*7, 23!=2^19*3^9*5^4*7^3*11^2*13*17*19*23.
%p A064394 for n from 3 to 10^3 do if sum(floor(n/(2^i)), i=1..15) = prevprime(n) 
               then printf(`%d,`,n) fi; od:
%Y A064394 Cf. A011371, A007917.
%Y A064394 Sequence in context: A020934 A094004 A067271 this_sequence A092022 A162902 
               A026491
%Y A064394 Adjacent sequences: A064391 A064392 A064393 this_sequence A064395 A064396 
               A064397
%K A064394 nonn
%O A064394 0,1
%A A064394 Vladeta Jovovic (vladeta(AT)eunet.rs), Sep 29 2001
%E A064394 More terms from James A. Sellers (sellersj(AT)math.psu.edu), Oct 01 2001

    
page 1

Search completed in 0.001 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 6 22:55 EST 2009. Contains 170429 sequences.


AT&T Labs Research