Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A039653
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A039653
%S A039653 0,0,2,3,6,5,11,7,14,12,17,11,27,13,23,23,30,17,38,19,41,31,35,23,59,30,
%T A039653 41,39,55,29,71,31,62,47,53,47,90,37,59,55,89,41,95,43,83,77,71,47,123,
%U A039653 56,92,71,97,53,119,71,119,79,89,59,167,61,95,103,126,83,143,67,125,95
%N A039653 a(0) = 0; for n > 0, a(n) = sigma(n)-1.
%C A039653 Call an integer k between 1 and n a "semi-divisor" of n if n leaves a 
               remainder of 1 when divided by k, i.e. n == 1 (mod k). a(n) gives 
               the sum of the semi-divisors of n+1. - Joseph L. Pe (joseph_l_pe(AT)hotmail.com), 
               Sep 11 2002
%F A039653 a(p) = p for p prime
%Y A039653 Cf. A000005, A039649-A039656, A032741.
%Y A039653 Sequence in context: A077320 A019565 A133477 this_sequence A106379 A001634 
               A095113
%Y A039653 Adjacent sequences: A039650 A039651 A039652 this_sequence A039654 A039655 
               A039656
%K A039653 nonn
%O A039653 0,3
%A A039653 David W. Wilson (davidwwilson(AT)comcast.net)

    
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