132000

Appears in sequences

• Expansion of susceptibility series related to Potts model.at n=5A007278
• Numbers n such that phi(n) is a proper substring of n.at n=12A066663
• Numbers n such that the digits of n end in phi(n).at n=13A067206
• Numbers k such that sigma(prime(k) - 1) == 0 (mod k).at n=44A067758
• Triangle T(n,k) read by rows, where T(n,k) = number of times the permanent of a real nonsingular n X n (0,1)-matrix takes the value k, for n >= 1, 1 <= k <= A000255(n).at n=30A089480
• Largest achievable determinant of a 4 X 4 matrix whose elements are the 16 consecutive integers n-15,...,n.at n=27A097696
• a(n) = number of digraphs (allowing loops) with vertices 1,2,...,n that have a unique Eulerian tour (up to cyclic shift).at n=6A102692
• Records in A160256.at n=35A151545
• Numbers with prime factorization pqr^3s^5.at n=16A190475
• Łukasiewicz words (without the last zero) for rooted plane trees where non-leaf branching can occur only at the leftmost branch of any level, but nowhere else.at n=44A209644
• Number A(n,k) of lattice paths without interior points from {n}^k to {0}^k using steps that decrement one component by 1; square array A(n,k), n>=0, k>=0, read by antidiagonals.at n=31A225094
• Number of lattice paths without interior points from {3}^n to {0}^n using steps that decrement one component by 1.at n=4A225096
• Number of lattice paths without interior points from {n}^4 to {0}^4 using steps that decrement one component by 1.at n=3A225220
• Composite numbers n such that n - phi(n) is a power of 10.at n=8A248857
• Number x = concat(MSD(x),b) such that MSD(x)*b = phi(x), where MSD(x) is the Most Significant Digit of x and phi(x) is the Euler totient function of x.at n=40A286130
• Numbers m such that the smallest digit in the decimal expansion of 1/m is 5, ignoring leading and trailing 0's.at n=18A352159