74130

Appears in sequences

• a(n) = n^3 + n.at n=42A034262
• Numbers with exactly 5 distinct prime factors each of which is a palindrome.at n=15A046403
• a(n) = n*(n^2 + 1) if n is even, otherwise (n - 1/2)*(n^2 + 1).at n=42A071289
• Numbers k having exactly 5 distinct prime factors, the largest of which is greater than or equal to sqrt(k) (i.e., sqrt(k)-rough numbers with exactly 5 distinct prime factors).at n=24A115959
• a(n) = 18522*n + 42.at n=3A157740
• a(n) = n + [n^2 if n is odd or n^3 if n is even].at n=41A181427
• Irregular triangle read by rows: T(n,k) is the number of binary pattern classes in the (7,n)-rectangular grid with k '1's and (7n-k) '0's: two patterns are in same class if one of them can be obtained by a reflection or 180-degree rotation of the other.at n=33A228166
• Irregular triangle read by rows: T(n,k) is the number of binary pattern classes in the (7,n)-rectangular grid with k '1's and (7n-k) '0's: two patterns are in same class if one of them can be obtained by a reflection or 180-degree rotation of the other.at n=36A228166
• Number T(n,k) of endofunctions on [n] where the smallest cycle length equals k; triangle T(n,k), n>=0, 0<=k<=n, read by rows.at n=31A246049
• Number of endofunctions on [n] where the smallest cycle length equals 3.at n=4A246190
• Number of uncrossed rooted knight's paths of length n on an infinite board.at n=6A323131
• a(n) = Sum_{k=1..n} phi(gcd(k, n))^3.at n=42A342535