Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A089580
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A089580
%S A089580 3,15,49,143,406,1174,3507,10674,32965,102716,321797,1011533,3186389,
%T A089580 10050743,31730134,100228040,316713623,1001037546,3164497349,
%U A089580 10004755374,31632975598,100021893194,316274794666,1000101078148
%N A089580 Total number of exact powers below 10^n (counting duplicates).
%e A089580 E.g. 16 = 2^4 = 4^2 counts double, 256 = 2^8 = 4^4 = 16^2 counts three 
               times.
%t A089580 Table[lim=10^n-1; Sum[Floor[lim^(1/k)]-1, {k,2,Floor[Log[2,lim]]}], {n,
               30}] - T. D. Noe (noe(AT)sspectra.com), Nov 16 2006
%Y A089580 Cf. A001597.
%Y A089580 Cf. A089579 (not counting duplicates).
%Y A089580 Sequence in context: A135622 A061316 A124161 this_sequence A034564 A012203 
               A112586
%Y A089580 Adjacent sequences: A089577 A089578 A089579 this_sequence A089581 A089582 
               A089583
%K A089580 nonn
%O A089580 1,1
%A A089580 Martin Renner (martin.renner(AT)gmx.net), Dec 29 2003
%E A089580 2 more terms from Martin Renner (martin.renner(AT)gmx.net), Oct 02 2004
%E A089580 More terms from T. D. Noe (noe(AT)sspectra.com), Nov 16 2006

    
page 1

Search completed in 0.002 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 November 30 13:13 EST 2009. Contains 167758 sequences.


AT&T Labs Research