Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A126167
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A126167 Number of primitive exponential amicable pairs (i,j) with i<j and i<=10^n. +0
1
0, 0, 0, 0, 1, 2, 3, 5, 8, 8, 12 (list; graph; listen)
OFFSET

1,6

COMMENT

There are infinitely many exponential amicable pairs, for multiplying an exponential amicable pair by a squarefree integer coprime to each of its members will generate another exponential amicable pair. Accordingly, we refer to pairs like (90972,100548) as primitive exponential amicable pairs, and to pairs like (454860,502740) that can be obtained from them as nonprimitive. This sequence counts the primitive pairs only.

LINKS

Pedersen J. M., Known amicable pairs.

EXAMPLE

a(7)=3 because there are 3 primitive exponential pairs (m,n) with m<n and m<=10^7

CROSSREFS

Cf. A051377, A054979, A049419, A054980, A126164, A126165, A126166.

Sequence in context: A141804 A121368 A010073 this_sequence A026260 A002153 A047607

Adjacent sequences: A126164 A126165 A126166 this_sequence A126168 A126169 A126170

KEYWORD

hard,nonn

AUTHOR

Ant King (mathstutoring(AT)ntlworld.com), Dec 21 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 July 26 23:19 EDT 2008. Contains 142293 sequences.


AT&T Labs Research