22477

Appears in sequences

• Cycle class sequence c(n) (the number of true cycles of length n in which a certain node is included) for zeolite DDR = Deca-dodecasil 3R[Si120O240]qR starting with a T1 atom.at n=13A019110
• Numbers whose square is palindromic in base 12.at n=27A029737
• Sums of distinct powers of 12.at n=27A033048
• If m = p_i^e_i, n=Product p_j^f_j, set G_m(n) = Product p_{j+i}^{f_j*e_i}; extend G_m to all m by multiplicativity; sequence gives a(n)=G_n(n).at n=20A045974
• Numbers k such that k^3 is palindromic in base 12.at n=9A046245
• Expansion of (1-x)^2/((1-x)^3-3x^4).at n=15A097120
• Large-number statistic from the enumeration of domino tilings of a 7-pillow of order n.at n=15A112840
• Concatenating n with n+1 (in base 10) gives a number which is the product of 2 palindromes.at n=16A113942
• Partial sum of A005915.at n=12A126274
• Difference between largest number of complexity n in the sense of A005245 and smallest number of complexity n in the sense of A005245.at n=27A133374
• Multiples of 1729, the Hardy-Ramanujan number.at n=13A138129
• Number of n X 3 binary arrays with every 1 having exactly two king-move neighbors equal to 1.at n=10A183444
• Nonprime numbers with a sum of nonprime divisors which is a perfect square.at n=34A194580
• Triangle T read by rows: T(n, m), for n >= 2, and m=1, 2, ..., n-1, equals the positive integer solution x of y^2 = x^3 - A(n, m)^2*x with the area A(n, m) = A249869(n, m) of the primitive Pythagorean triangle characterized by (n, m) or 0 if no such triangle exists.at n=71A278711
• Square array A(n,k) = A341527(A246278(n,k)), read by falling antidiagonals; denominators of the columnwise first quotients of A341605/A341606.at n=19A341627
• Number of partitions of prime(n) containing a prime number of primes.at n=12A343753
• Number of partitions of n containing a prime number of primes and an arbitrary number of nonprimes.at n=41A344677
• If F is the Fermat point of a triangle ABC with A < B < C < 2*Pi/3, where AB, BC, CA, FA, FB and FC are all positive integers, then, this sequence gives the sum FA + FB + FC when gcd(a, b, c) = A351477(n).at n=30A351476
• Three-column array giving list of primitive triples for integer-sided triangles with A < B < C < 2*Pi/3 and such that FA, FB, FC are also integers where F is the Fermat point of the triangle.at n=42A352360