27042

Appears in sequences

• a(0) = 1, a(n) = 40*n^2 + 2 for n>0.at n=26A010022
• Barely abundant numbers: abundant n such that sigma(n)/n < sigma(m)/m for all abundant numbers m<n, sigma(n) being the sum of the divisors of n.at n=19A071927
• a(n) = 81*n^2 - 118*n + 43.at n=19A156677
• Number of 0..n arrays of length 5 with each element differing from at least one neighbor by 1 or less.at n=22A221597
• Number of nX7 binary arrays with some element plus some horizontally, diagonally or antidiagonally adjacent neighbor totalling two not more than once.at n=2A269074
• T(n,k)=Number of nXk binary arrays with some element plus some horizontally, diagonally or antidiagonally adjacent neighbor totalling two not more than once.at n=38A269075
• Number of 3 X n binary arrays with some element plus some horizontally, diagonally or antidiagonally adjacent neighbor totalling two not more than once.at n=6A269077
• Expansion of Sum_{k>=1} mu(k)^2*x^k*(1 - x)^2/(1 - 2*x)^2, where mu() is the Moebius function (A008683).at n=12A284942
• Number of multisets of nonempty binary words with a total of n letters such that no word has a majority of 0's.at n=12A292548
• Numbers n such that (6k-1) for k=n, n+1, n+2, n+3 are all primes with no primes of the form (6k+1) in between.at n=24A296011
• Number of integer compositions of n whose leaders of weakly increasing runs are strictly increasing.at n=25A374634