login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A081397 Least x=a(n) such that GCD of sigma[x]=A000203(x) and phi[x]=A000010(x) equals n-th primorial=A002110[n]. 1
3, 14, 488, 16072, 284229, 29221621, 25014312576 (list; graph; refs; listen; history; internal format)
OFFSET

1,1

COMMENTS

a(8) <= 1524139588224. [From Donovan Johnson (donovan.johnson(AT)yahoo.com), Dec 14 2009]

FORMULA

a[n]=Min{x; A081396[x]=A002110[n]}

EXAMPLE

n=284229: sigma[284229]=482790=2.3.5.7.11.19, phi[284229]=166320=2.2.2.3.3.3.3.5.7.11, common-factor-set={2,3,5,7,11}, GCD[sigma,phi]=2310.

CROSSREFS

Cf. A000203, A002110, A000010, A081383, A081396.

Sequence in context: A133028 A144985 A168590 * A092987 A088334 A050645

Adjacent sequences:  A081394 A081395 A081396 * A081398 A081399 A081400

KEYWORD

nonn

AUTHOR

Labos E. (labos(AT)ana.sote.hu), Mar 28 2003

EXTENSIONS

a(6) corrected and a(7) from Donovan Johnson (donovan.johnson(AT)yahoo.com), Dec 14 2009

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 15 05:45 EST 2012. Contains 205694 sequences.