|
Search: id:A055076
|
|
|
| A055076 |
|
Multiplicity of Max{GCD[d,n/d]} when d runs over divisors if n. |
|
+0
1
|
|
| 1, 2, 2, 1, 2, 4, 2, 2, 1, 4, 2, 2, 2, 4, 4, 1, 2, 2, 2, 2, 4, 4, 2, 4, 1, 4, 2, 2, 2, 8, 2, 2, 4, 4, 4, 1, 2, 4, 4, 4, 2, 8, 2, 2, 2, 4, 2, 2, 1, 2, 4, 2, 2, 4, 4, 4, 4, 4, 2, 4, 2, 4, 2, 1, 4, 8, 2, 2, 4, 8, 2, 2, 2, 4, 2, 2, 4, 8, 2, 2, 1, 4, 2, 4, 4, 4, 4, 4, 2, 4, 4, 2, 4, 4, 4, 4, 2, 2, 2, 1, 2, 8, 2, 4, 8
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
Number of distinct values of GCD[d,n!/d] if d runs over divisors of n! seems to be A046951(n).
|
|
FORMULA
|
Multiplicative with a(p^e) = 2^(e mod 2). - Vladeta Jovovic (vladeta(AT)eunet.rs), Dec 13 2002
|
|
EXAMPLE
|
n=120, the set of GCD[d,120/d] values for the 16 divisors of 120 is:{1,2,1,2,1,2,1,2,2,1,2,1,2,1,2,1}. Tha max is 2 and it occurs 8 times, so a(120)=8. These sequence seems consisting of powers if 2.
|
|
CROSSREFS
|
Cf. A000188.
Adjacent sequences: A055073 A055074 A055075 this_sequence A055077 A055078 A055079
Sequence in context: A048106 A156260 A056671 this_sequence A069780 A066954 A144925
|
|
KEYWORD
|
nonn,mult
|
|
AUTHOR
|
Labos E. (labos(AT)ana.sote.hu), Jun 13 2000
|
|
|
Search completed in 0.002 seconds
|
