Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A082062
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A082062 Greatest common prime-divisor of n and Sigma[n]=A000203(n); a(n)=1 if no common prime-divisor was found. +0
1
1, 1, 1, 1, 1, 3, 1, 1, 1, 2, 1, 2, 1, 2, 3, 1, 1, 3, 1, 2, 1, 2, 1, 3, 1, 2, 1, 7, 1, 3, 1, 1, 3, 2, 1, 1, 1, 2, 1, 5, 1, 3, 1, 2, 3, 2, 1, 2, 1, 1, 3, 2, 1, 3, 1, 2, 1, 2, 1, 3, 1, 2, 1, 1, 1, 3, 1, 2, 3, 2, 1, 3, 1, 2, 1, 2, 1, 3, 1, 2, 1, 2, 1, 7, 1, 2, 3, 2, 1, 3, 7, 2, 1, 2, 5, 3, 1, 1, 3, 1, 1, 3, 1, 2, 3 (list; graph; listen)
OFFSET

1,6

MATHEMATICA

"factors/exponent SET "; ffi[x_] := Flatten[FactorInteger[x]] lf[x_] := Length[FactorInteger[x]] ba[x_] := Table[Part[ffi[x], 2*w-1], {w, 1, lf[x]}] f1[x_] := x; f2[x_] := DivisorSigma[1, x] Table[Max[Intersection[ba[f1[w]], ba[f2[w]]]], {w, 1, 128}]

CROSSREFS

Cf. A006530, A000203, A082061-A082065.

Adjacent sequences: A082059 A082060 A082061 this_sequence A082063 A082064 A082065

Sequence in context: A090751 A030369 A023520 this_sequence A030370 A100808 A010277

KEYWORD

nonn

AUTHOR

Labos E. (labos(AT)ana.sote.hu), Apr 07 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 October 13 02:37 EDT 2008. Contains 145008 sequences.


AT&T Labs Research