41895
domain: N
Appears in sequences
- Decimal part of n^(1/11) starts with a 'nine digits' anagram.at n=14A034286
- Triangle T(n,k) read by rows: (1/n) * C(2n+k,k-1) * C(n,k); n, k >= 1.at n=32A102537
- Triangle read by rows: T(k,s)=(2k-1)(2k+1)binomial(2k-s-1,2k-2s-1)/(2k-2s+1); k>=1, 0<=s<=k-1.at n=49A111127
- a(n) = numerator of r(n): r(n) is such that, for every positive integer n, the continued fraction (of rational terms) [r(1);r(2),...,r(n)] equals n(n+1)/2, the n-th triangular number.at n=9A128536
- Odd doubly abundant numbers (A125639).at n=4A129087
- a(n) = nonnegative value y such that (A155135(n), y) is a solution to the Diophantine equation x^3+28*x^2 = y^2.at n=36A155137
- a(n) = nonnegative value y such that (A155136(n), y) is a solution to the Diophantine equation x^3+28*x^2 = y^2.at n=35A155138
- Expansion of 1/E(q/E(q)) where E(q) = Product_{n>=1} (1 - q^n).at n=11A238440
- a(n) = 6*a(n-1) + 3*(2^(n-2)-1) for n > 2, a(0)=a(1)=a(2)=0.at n=8A241271
- Triangle read by rows: the reversed x = 1+q Narayana triangle at m=2.at n=31A243662
- Maximum determinant of an n X n matrix with n copies of the numbers 1 .. n.at n=6A301371
- Maximum determinant of an n X n Latin square.at n=6A309985
- Maximum determinant of a circulant n X n matrix whose rows are permutations of [1,2,..,n].at n=6A328030
- Odd numbers k such that A162296(k) > 2*k.at n=26A357607
- Odd numbers k such that gcd(A276086(sigma(k)-k), A276086(k)) is equal to A276086(k), where A276086 is the primorial base exp-function, and sigma is the sum of divisors function.at n=27A388267