22517

Appears in sequences

• a(n) = floor(n(n+2)(2n+1)/8).at n=44A002717
• a(n) = n*(2^n - 1).at n=11A066524
• Numbers k such that gcd(3k,8^k+1) = 3 but k does not divide the numerator of B(2k) (the Bernoulli numbers).at n=33A070193
• a(n) is the number of cubes with at most n digits and first digit 1.at n=14A083380
• Indices of primes in sequence defined by A(0) = 31, A(n) = 10*A(n-1) + 11 for n > 0.at n=11A101828
• Numbers k such that the value pi(k), the number of primes <= k, can be obtained deleting some of the repeating adjacent digits of k.at n=2A113898
• a(n) = n*(n+1)*(4*n+1)/2.at n=22A135713
• Partial sums of A164095.at n=21A164096
• Number of different figures obtained by a putting two Young diagrams of partitions lambda and mu, such that |lambda| + |mu| = n on top of each other.at n=29A225751
• Numbers k whose decimal representation ends with that of pi(k) (where pi denotes the prime counting function A000720).at n=13A306572
• Number of separable partitions of n in which the number of distinct (repeatable) parts is > 1.at n=38A325716
• Numbers that are both binary palindromes and binary Niven numbers.at n=4A334529
• Numbers that are both binary palindromes and binary Smith numbers.at n=38A334530
• Binary palindromic numbers that are also binary Niven and binary Smith numbers.at n=0A334532
• Number of integer compositions of n with all prime run-lengths.at n=30A353401
• Square array T(n,k) read by ascending antidiagonals: T(n,k) = (p - 1)/2*(2*(n - 1)*p^(n - 1) - (2*n - 3)*p^(n - 2)), n>=2, where p is the k-th odd prime.at n=43A391520