Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A071116
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A071116 Least m such that sigma(n + phi(m)) = sigma(phi(m)). +0
1
2049, 81, 383, 67, 7, 25, 11, 103, 17, 271, 29, 159, 1416741, 35 (list; graph; listen)
OFFSET

1,1

COMMENT

a(15), if it exists, is at least 7*10^7.

MATHEMATICA

a[n_] := For[m=1, True, m++, p=EulerPhi[m]; If[DivisorSigma[1, n+p]==DivisorSigma[1, p], Return[m]]]

CROSSREFS

Cf. A000010, A000203.

Adjacent sequences: A071113 A071114 A071115 this_sequence A071117 A071118 A071119

Sequence in context: A017303 A017423 A017555 this_sequence A060949 A017685 A013959

KEYWORD

nonn

AUTHOR

Jason Earls (zevi_35711(AT)yahoo.com), May 27 2002

EXTENSIONS

Edited by Dean Hickerson (dean(AT)math.ucdavis.edu), Jun 02 2002

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 October 10 20:39 EDT 2008. Contains 144831 sequences.


AT&T Labs Research