20473

Appears in sequences

• Denominators of continued fraction convergents to sqrt(253).at n=11A041475
• a(n) = sum of squares of first n odd primes.at n=16A133547
• a(n) is the number of numbers removed in each step of Eratosthenes's sieve for 10!.at n=9A145537
• A recursion triangle sequence: A(n,k) = A(n-1,k-1)+e(n-1,k) where e(n,k)=Sum[(-1)^j Binomial[n + 1, j](k - j)^n, {j, 0, k}].at n=62A157744
• Number of binary strings of length n with equal numbers of 00000 and 00100 substrings.at n=15A164181
• Number of n X 4 1..2 arrays containing at least one of each value, all equal values connected, rows considered as a single number in nondecreasing order, and columns considered as a single number in nondecreasing order.at n=23A166805
• E.g.f. satisfies: A'(x) = A(x)^7 * A(-x)^2 with A(0) = 1.at n=5A236955
• Number of partitions of n into parts whose bitwise AND equals 0.at n=37A307435
• Numbers that are both binary palindromes and binary Smith numbers.at n=37A334530
• Odd composite integers m such that A001906(m-J(m,5)) == 0 (mod m) and gcd(m,5)=1, where J(m,5) is the Jacobi symbol.at n=36A340097
• Odd composite integers m such that A004187(m-J(m,45)) == 0 (mod m) and gcd(m,45)=1, where J(m,45) is the Jacobi symbol.at n=38A340099