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

 

Logo

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 56th year, we are closing in on 350,000 sequences, and we’ve crossed 9,700 citations (which often say “discovered thanks to the OEIS”).

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A272242 a(n) is the least number c such that there are exactly n abc-hits with third member c, or 0 if no such c exists. 1
9, 81, 625, 729, 87808, 14641, 130321, 6561, 65536, 59049, 78125 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

COMMENTS

An abc-hit is a triple of coprime positive integers a, b, c such that a + b = c and rad(abc) < c, where rad(n) is the largest squarefree number dividing n.

Conjecture: a(n) > 0 for all n. - Jianing Song, Sep 21 2018

LINKS

Table of n, a(n) for n=1..11.

Wikipedia, abc conjecture

EXAMPLE

a(2) = 81 because there are exactly 2 abc-hits ((1, 80, 81) and (32, 49, 81)) with third member 81 and count of abc-hits with fixed third member c isn't equal to 2 for every c < 81.

CROSSREFS

Cf. A272243.

Cf. A120498, A130510 (possible values of c in abc-hits).

Cf. A225426 (triples of abc-hits).

Cf. A130512 (radicals of abc-hits).

Cf. A007947 (radicals).

Sequence in context: A267961 A213297 A272243 * A206728 A206857 A073531

Adjacent sequences:  A272239 A272240 A272241 * A272243 A272244 A272245

KEYWORD

nonn,hard,more

AUTHOR

Vladimir Letsko, Apr 23 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 29 21:32 EST 2021. Contains 349416 sequences. (Running on oeis4.)