Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A069784
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A069784 GCD[d[(n!)^3],d[n! ]]=2^k, i.e. is a power of 2. +0
2
1, 2, 3, 4, 5, 6, 7, 8, 9, 12, 13, 14, 18, 19, 30, 31, 32, 35, 38, 39 (list; graph; listen)
OFFSET

1,2

EXAMPLE

The corresponding powers of 2 are in A068783.

MATHEMATICA

Do[s=GCD[DivisorSigma[0, (n!)^3], DivisorSigma[0, n! ]]; If[IntegerQ[n/100], Print[{n}]]; If[IntegerQ[Log[2, s]], Print[n]], {n, 1, 10000}]

CROSSREFS

Cf. A000005, A000142, A069780-A069783.

Sequence in context: A009993 A055569 A072618 this_sequence A048097 A130843 A087087

Adjacent sequences: A069781 A069782 A069783 this_sequence A069785 A069786 A069787

KEYWORD

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 December 7 23:50 EST 2009. Contains 170430 sequences.


AT&T Labs Research