45990

Appears in sequences

• a(n) = (11*n+1)*(11*n+10).at n=19A001536
• Numbers k such that the sum of unitary divisors of k^2 is a square.at n=18A064498
• Number of functions from [1,2,...,n] to [1,2,...,n] such that the image contains exactly two elements.at n=8A068605
• a(n) = n^3 - n*(n+1)/2.at n=36A160378
• Numbers that have 11 terms in their Zeckendorf representation.at n=4A179251
• Number of nondecreasing arrangements of n+3 numbers in 0..4 with each number being the sum mod 5 of three others.at n=26A183899
• Triangle read by rows: T(n,k) is the number of secondary structures of size n with no stacks of length >=2 and having k stacks of length 1 (n>=0, k>=0).at n=66A202851
• Triangle T(n,k) read by rows: the number of independent sets of size k in the 132 core of size n.at n=49A278390
• Triangle read by rows T(n, m) = sigma^*_(n-m)(m), n >= 1, m = 1, 2, ..., n, with sigma^*_(k)(n) given in a comment in A279395.at n=71A279396
• a(n) = Sum_{d|n} (-1)^(n/d+1)*d^6.at n=5A284927
• a(n) = Sum_{d|n} (-1)^(n/d+1)*d^n.at n=5A321438
• Square array A(n,k), n >= 1, k >= 0, read by antidiagonals: A(n,k) = Sum_{d|n} (-1)^(n/d+1)*d^k.at n=71A322081
• a(n) is the smallest number that can be partitioned into n ways as the sum of two brilliant numbers (A078972).at n=39A338474
• a(n) = Sum_{k=1..n} (-1)^(k+1) * floor(n/k)^n.at n=5A344724
• Square array T(n,k), n >= 1, k >= 1, read by antidiagonals downwards, where T(n,k) = Sum_{j=1..n} (-1)^(j+1) * floor(n/j)^k.at n=60A344726
• Triangle of numbers read by rows, T(n, k) = (n*(n-1))*Stirling2(k, 2), for n >= 1 and 1 <= k <= n.at n=54A362685
• Triangle read by rows. T(n, k) = FallingFactorial(n - k, k) * Stirling2(n - k, k), for n >= 0 and 0 <= k <= n//2, where '//' denotes integer division.at n=44A362789
• Primitive terms of A023197 that are of the form 4u+2.at n=31A388020