A212173 -id:A212173 - cp's OEIS frontend

A212172 Row n of table represents second signature of n: list of exponents >= 2 in canonical prime factorization of n, in nonincreasing order, or 0 if no such exponent exists.

0, 0, 0, 2, 0, 0, 0, 3, 2, 0, 0, 2, 0, 0, 0, 4, 0, 2, 0, 2, 0, 0, 0, 3, 2, 0, 3, 2, 0, 0, 0, 5, 0, 0, 0, 2, 2, 0, 0, 0, 3, 0, 0, 0, 2, 2, 0, 0, 4, 2, 2, 0, 2, 0, 3, 0, 3, 0, 0, 0, 2, 0, 0, 2, 6, 0, 0, 0, 2, 0, 0, 0, 3, 2, 0, 0, 2, 2, 0, 0, 0, 4, 4, 0, 0, 2, 0, 0

Offset: 1

Matthew Vandermast, Jun 03 2012

Length of row n equals A056170(n) if A056170(n) is positive, or 1 if A056170(n) = 0.
The multiset of exponents >=2 in the prime factorization of n completely determines a(n) for over 20 sequences in the database (see crossreferences). It also determines the fractions A034444(n)/A000005(n) and A037445(n)/A000005(n).
For squarefree numbers, this multiset is { } (the empty multiset). The use of 0 in the table to represent each n with no exponents >=2 in its prime factorization accords with the usual OEIS practice of using 0 to represent nonexistent elements when possible. In comments, the second signature of squarefree numbers will be represented as { }.
For each second signature {S}, there exist values of j and k such that, if the second signature of n is {S}, then A085082(n) is congruent to j modulo k.  These values are nontrivial unless {S} = { }. Analogous (but not necessarily identical) values of j and k also exist for each second signature with respect to A088873 and A181796.
Each sequence of integers with a given second signature {S} has a positive density, unlike the analogous sequences for prime signatures. The highest of these densities is 6/Pi^2 = 0.607927... for A005117 ({S} = { }).

			First rows of table read: 0; 0; 0; 2; 0; 0; 0; 3; 2; 0; 0; 2;...
12 = 2^2*3 has positive exponents 2 and 1 in its canonical prime factorization (1s are often left implicit as exponents). Since only exponents that are 2 or greater appear in a number's second signature, 12's second signature is {2}.
30 = 2*3*5 has no exponents greater than 1 in its prime factorization. The multiset of its exponents >= 2 is { } (the empty multiset), represented in the table with a 0.
72 = 2^3*3^2 has positive exponents 3 and 2 in its prime factorization, as does 108 = 2^2*3^3. Rows 72 and 108 both read {3,2}.

Jason Kimberley, Table of i, a(i) for i = 1..10575 (n = 1..10000)
M. Abramowitz and I. A. Stegun, eds., Handbook of Mathematical Functions, National Bureau of Standards, Applied Math. Series 55, Tenth Printing, 1972 [alternative scanned copy].
Primefan, The First 2500 Integers Factored (1st of 5 pages)

A181800 gives first integer of each second signature. Also see A212171, A212173-A212181, A212642-A212644.
Functions determined by exponents >=2 in the prime factorization of n:
Multiplicative: A000688, A005361, A008966, A038538, A046951, A049419, A050361, A050377, A056624, A061704, A063775, A162510, A162511, A212181.
Additive: A046660, A056170.
Other: A007424, A051903 (for n > 1), A056626, A066301, A071325, A072411, A091050, A107078, A185102 (for n > 1), A212180.
Sequences that contain all integers of a specific second signature: A005117 (second signature { }), A060687 ({2}), A048109 ({3}).

&cat[IsEmpty(e)select [0]else Reverse(Sort(e))where e is[pe[2]:pe in Factorisation(n)|pe[2]gt 1]:n in[1..102]]; // Jason Kimberley, Jun 13 2012

row[n_] := Select[ FactorInteger[n][[All, 2]], # >= 2 &] /. {} -> 0 /. {k__} -> Sequence[k]; Table[row[n], {n, 1, 100}] (* Jean-François Alcover, Apr 16 2013 *)

For nonsquarefree n, row n is identical to row A057521(n) of table A212171.

A212180 Number of distinct second signatures (cf. A212172) represented among divisors of n.

Original entry on oeis.org

1, 1, 1, 2, 1, 1, 1, 3, 2, 1, 1, 2, 1, 1, 1, 4, 1, 2, 1, 2, 1, 1, 1, 3, 2, 1, 3, 2, 1, 1, 1, 5, 1, 1, 1, 3, 1, 1, 1, 3, 1, 1, 1, 2, 2, 1, 1, 4, 2, 2, 1, 2, 1, 3, 1, 3, 1, 1, 1, 2, 1, 1, 2, 6, 1, 1, 1, 2, 1, 1, 1, 5, 1, 1, 2, 2, 1, 1, 1, 4, 4, 1, 1, 2, 1, 1, 1, 3

Offset: 1

Matthew Vandermast, Jun 04 2012

nonn

Completely determined by the exponents >=2 in the prime factorization of n (cf. A212172, A212173).

The fraction of the divisors of n which have a given second signature {S} is also a function of n's second signature. For example, if n has second signature {3,2}, it follows that 1/3 of n's divisors are squarefree. Squarefree numbers are represented with 0's in A212172, in accord with the usual OEIS custom of using 0 for nonexistent elements; in comments, their second signature is represented as { }.

			The divisors of 72 represent a total of 5 distinct second signatures (cf. A212172), as can be seen from the exponents >= 2, if any, in the canonical prime factorization of each divisor:
{ }: 1, 2 (prime), 3 (prime), 6 (2*3)
{2}: 4 (2^2), 9 (3^2), 12 (2^2*3), 18 (2*3^2)
{3}: 8 (2^3), 24 (2^3*3)
{2,2}: 36 (2^2*3^2)
{3,2}: 72 (2^3*3^2)
Hence, a(72) = 5.

Antti Karttunen, Table of n, a(n) for n = 1..10000
Index entries for sequences computed from exponents in factorization of n

Cf. A212172, A085082, A088873, A181796, A182860, A212173, A212642, A212643, A212644.

Array[Length@ Union@ Map[Sort@ Select[FactorInteger[#][[All, -1]], # >= 2 &] &, Divisors@ #] &, 88] (* Michael De Vlieger, Jul 19 2017 *)

A046523(n) = { my(f=vecsort(factor(n)[, 2], , 4), p); prod(i=1, #f, (p=nextprime(p+1))^f[i]); }; \\ This function from Charles R Greathouse IV, Aug 17 2011
A057521(n) = { my(f=factor(n)); prod(i=1, #f~, if(f[i, 2]>1, f[i, 1]^f[i, 2], 1)); } \\ This function from Charles R Greathouse IV, Aug 13 2013
A212173(n) = A046523(A057521(n));
A212180(n) = { my(vals = Set()); fordiv(n, d, vals = Set(concat(vals, A212173(d)))); length(vals); }; \\ Antti Karttunen, Jul 19 2017

from sympy import factorint, divisors, prod
def P(n): return sorted(factorint(n).values())
def a046523(n):
    x=1
    while True:
        if P(n)==P(x): return x
        else: x+=1
def a057521(n): return 1 if n==1 else prod(p**e for p, e in factorint(n).items() if e != 1)
def a212173(n): return a046523(a057521(n))
def a(n):
    l=[]
    for d in divisors(n):
        x=a212173(d)
        if not x in l:l+=[x, ]
    return len(l)
print([a(n) for n in range(1, 51)]) # Indranil Ghosh, Jul 19 2017

cp's OEIS Frontend

A212172 Row n of table represents second signature of n: list of exponents >= 2 in canonical prime factorization of n, in nonincreasing order, or 0 if no such exponent exists.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Magma

Mathematica

Formula