Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A126161
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A126161 Number of augmented amicable pairs (m,n) with m<n and for which m<=10^k, k=1,2,3,... +0
1
0, 0, 0, 1, 4, 9, 36, 84, 188, 420, 930, 1931 (list; graph; listen)
OFFSET

1,5

LINKS

J. M. Pedersen, Known amicable pairs.

FORMULA

An augmented amicable pair (m,n) is a pair of integers m, n with m<n and for which sigma(m)=sigma(n)=m+n-1

EXAMPLE

a(6)=9 because there are 9 augmented amicable pairs with m<=10^6

MATHEMATICA

s[n_]:=DivisorSigma[1, n]-n; AugmentedAmicableNumberQ[n_]:=If[s[s[n]+1]==n-1 && !DivisorSigma[1, n]==2n-1, True, False]; AugmentedAmicablePairList[ k_]:=(bnlist=Select[Range[k], AugmentedAmicableNumberQ[ # ]&]; newprlist= Table[Sort[{bnlist[[n]], s[bnlist[[n]]]+1}], {n, 1, Length[bnlist]}]; augamprlist=Union[newprlist, newprlist]); data=AugmentedAmicablePairList[10^7]; Table[Length[Select[data, First[ # ]<10^k &]], {k, 1, 7}]

CROSSREFS

Cf. A007992, A015630.

Sequence in context: A115700 A029806 A133125 this_sequence A018224 A149137 A149138

Adjacent sequences: A126158 A126159 A126160 this_sequence A126162 A126163 A126164

KEYWORD

hard,nonn

AUTHOR

Ant King (mathstutoring(AT)ntlworld.com), Dec 20 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 24 23:16 EST 2009. Contains 167481 sequences.


AT&T Labs Research