login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A273970 Numbers x such that there exist a pair y, n with x < y, x != n and y != n that makes {x,y,n,n} an amicable multiset. 3
695520, 753480, 1113840, 1136520, 1784160, 2313360, 2898720, 3140280, 3865680, 3960600, 4272840, 4500720, 4626720, 6126120, 6167700, 7197960, 7442820, 7731360, 8177400, 8498700, 8784720, 8828820, 8920800, 8966160, 9124920, 9232860, 9664200, 9729720 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

COMMENTS

We call the multiset {x,y,n,n} amicable iff sigma(x) = sigma(y) = sigma(n) = x+y+n+n. For the n values, see A273969. For the y values, see A273971.

If the condition x<y were dropped, the terms from A259306 would also belong here.

LINKS

John Cerkan, Table of n, a(n) for n = 1..8060

John Cerkan, Python code

EXAMPLE

sigma(695520) = sigma(803040) = sigma(702240) = 695520 + 803040 + 702240 + 702240.

CROSSREFS

Cf. A259302, A259303, A259304, A259305, A259306, A273969, A273971.

Sequence in context: A068745 A010084 A209735 * A345604 A346358 A206518

Adjacent sequences:  A273967 A273968 A273969 * A273971 A273972 A273973

KEYWORD

nonn

AUTHOR

John Cerkan, Jul 17 2016

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified November 27 03:56 EST 2021. Contains 349345 sequences. (Running on oeis4.)