Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A081397
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A081397 Least x=a(n) such that GCD of sigma[x]=A000203(x) and phi[x]=A000010(x) equals n-th primorial=A002110[n]. +0
2
3, 14, 488, 16072, 284229, 2179316 (list; graph; listen)
OFFSET

1,1

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: A001320 A133028 A144985 this_sequence A092987 A088334 A050645

Adjacent sequences: A081394 A081395 A081396 this_sequence A081398 A081399 A081400

KEYWORD

nonn

AUTHOR

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

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