Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A085496
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A085496
%S A085496 0,1,1,1,2,0,1,1,5,3,1,0,2,0,10,1,31,0,0,26,0,6,23,20,0,0,1,13,0,0,1,15,
%T A085496 0,14,9,0,0,0,190,0,713,0,42,0,7,9,0,9,6,0,6,2148,0,509,0,120,109,1,0,
               0,
%U A085496 0,4,6,100,0,0,0,0,2,4,0,21897,1,0,3,85,79,0,0,0,19172,0,1130
%N A085496 Number of ways to write prime(n) as sum of distinct divisors of prime(n)+1.
%C A085496 a(n) = A085491(A000040(n));
%C A085496 a(A085498(n)) > 0.
%e A085496 n=5, divisors of A000040(5)+1=11+1=12 that are not greater 11: {1,2,3,
               4,6}, 11=6+4+1=6+3+2, therefore a(5)=2.
%Y A085496 Sequence in context: A049501 A102564 A077762 this_sequence A101661 A079644 
               A072705
%Y A085496 Adjacent sequences: A085493 A085494 A085495 this_sequence A085497 A085498 
               A085499
%K A085496 nonn
%O A085496 1,5
%A A085496 Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Jul 03 2003

    
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 27 22:38 EST 2009. Contains 167602 sequences.


AT&T Labs Research