Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A147802
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A147802 Least m coprime to 3 minimizing A007947(m(3^n-m)) +0
4
1, 1, 2, 1, 1, 25, 139, 289, 31, 1, 16096, 49, 7424, 588665, 619115, 83521 (list; graph; listen)
OFFSET

1,3

COMMENT

Related to the abc conjecture: Since m is coprime to 3, it is also coprime to 3^n and thus to 3^n-m. Thus A007947(m (3^n-m) 3^n)=3*A007947(m(3^n-m)). See also A143700 for the 2^n analogue and A147300 for the general case.

PROGRAM

(PARI) A147802(n, p=3)={local(b, m=n=p^n); for(a=1, (n-1)\2, a%p|next; A007947(n-a)*A007947(a)<m|next; m=A007947((n-a)*b=a)); b}

CROSSREFS

Cf. A007947, A147300, A143700.

Sequence in context: A156889 A156725 A141904 this_sequence A093076 A132454 A058293

Adjacent sequences: A147799 A147800 A147801 this_sequence A147803 A147804 A147805

KEYWORD

hard,more,nonn

AUTHOR

M. F. Hasler (MHasler(AT)univ-ag.fr), Nov 13 2008

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