Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A058953
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A058953
%S A058953 2,3,10,28,176,832,4352,19456,47104,1900544,4063232,77594624
%N A058953 p is prime; x>=0; n = p*2^x; m is 0 or 1; n such that tau(n)-m = A058933(n), 
               where tau(n) = number of divisors of n.
%C A058953 (p=2 => m=1); ( Conjecture: [for p>2]; if p=A040069 then m=0 else m=1. 
               )
%Y A058953 Cf. A000005, A040069, A040070, A058933.
%Y A058953 Sequence in context: A099435 A140453 A037169 this_sequence A160909 A004980 
               A034324
%Y A058953 Adjacent sequences: A058950 A058951 A058952 this_sequence A058954 A058955 
               A058956
%K A058953 more,nonn
%O A058953 2,1
%A A058953 Naohiro Nomoto (6284968128(AT)geocities.co.jp), Jan 13 2001

    
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 December 8 08:31 EST 2009. Contains 170430 sequences.


AT&T Labs Research