Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A069781
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A069781 n is such that GCD[d(n^3),d(n)] is not a power of 2. +0
3
432, 576, 648, 1600, 2000, 2160, 2880, 2916, 3024, 3136, 3240, 4032, 4536, 4752, 4800, 5000, 5488, 5616, 6000, 6336, 7128, 7344, 7488, 7744, 8208, 8424, 9408, 9792, 9936, 10125, 10800, 10816, 10944, 11016, 11200, 12312, 12528, 13248, 13392 (list; graph; listen)
OFFSET

1,1

FORMULA

Log [2, GCD[A000005(n^3), A000005(n)]] is nonintegral.

EXAMPLE

For n<100000,GCD[d(n^3),d[n]]={5,7,10,14,20,28,40,80} which is obtained for n={20736,576,432,2880,54000,20160,2160,15120} respectively.

MATHEMATICA

f[x_] := GCD[DivisorSigma[0, x^3], DivisorSigma[0, x]] Do[s=f[n]; If[ !IntegerQ[Log[2, s]], Print[n]], {n, 1, 100000}]

CROSSREFS

Cf. A000005, A061701, A037992, A069780, A069782.

Sequence in context: A063463 A175026 A066419 this_sequence A006910 A015229 A109123

Adjacent sequences: A069778 A069779 A069780 this_sequence A069782 A069783 A069784

KEYWORD

easy,nonn

AUTHOR

Labos E. (labos(AT)ana.sote.hu), Apr 08 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 November 27 14:50 EST 2009. Contains 167570 sequences.


AT&T Labs Research