171366

Appears in sequences

• Numbers k such that k | 11^k + 10^k + 9^k + 8^k.at n=24A057240
• Numbers k such that k | 5^k + 4^k + 3^k + 2^k.at n=28A057249
• Numbers n such that n | 7^n + 5^n + 3^n +1.at n=39A057830
• Numbers of the form (6^i)*(13^j), with i, j >= 0.at n=21A107710
• Triangle read by rows: T(n,m) = Prime[m]^n*(Prime[m] - 1)/2.at n=18A121057
• a(n) = (prime(n)^5 - prime(n)^4)/2.at n=5A138439
• Number of 2 X 2 matrices with all elements in {0,1,...,n} and odd determinant.at n=25A210370
• Number of 2 X 2 matrices having all terms in {1,...,n} and odd determinant.at n=25A211065
• Fixed points of A153212: After a(1) = 1, numbers of the form p_i1^i1 * p_i2^(i2-i1) * p_i3^(i3-i2) * ... * p_ik^(ik-i_{k-1}), where p_i's are distinct primes present in the prime factorization of n, with i1 < i2 < i3 < ... < ik, and k = A001221(n) and ik = A061395(n).at n=54A242421
• Numbers k such that the k-th cyclotomic polynomial has a root mod 13.at n=28A245481
• Integers n such that the circular graph C_n has a square size deficiency.at n=7A270889
• Numbers k such that A007913(k) divides sigma(k) and A008833(k)-1 either divides A326127(k) (= sigma(k)-core(k)-k), or both are zero.at n=22A336641
• Square array read by upward antidiagonals in which T(w,p) is the smallest number k whose symmetric representation of sigma(k) consists of p parts with maximum width w occurring in everyone of its p parts.at n=19A348142
• Square array T(n, k), n >= 1, k >= 1, read by antidiagonals, of the least numbers whose symmetric representation of sigma instantiate the unimodal width pattern 1, 2, ..., n, ..., 2, 1 repeated k times separated by instances of width 0.at n=19A367377
• Square array read by antidiagonals upwards in which T(n,m) is the n-th number whose symmetric representation of sigma consists of m copies of unimodal pattern 121 (separated by 0's if m > 1).at n=14A372180
• a(n) is the smallest number whose symmetric representation of sigma consists of n copies of unimodal pattern 121 (separated by 0's if n > 1).at n=4A372181