29375

Appears in sequences

• Number of NP-equivalence classes of threshold functions of n or fewer variables.at n=7A000617
• a(n) = (2*n - 3)n^2.at n=25A015238
• a(n) = ((5+sqrt(5))/2)^n + ((5-sqrt(5))/2)^n.at n=8A020876
• Smallest number a(n) == -1 (mod n) such that the prime signature of n and a(n) is the same, or 0 if no such number exists.at n=46A085075
• Binomial transform of Fibonacci(2n-1) (A001519).at n=9A093129
• Expansion of ((1+x)^3 - x^3)/((1+x)^5 - x^5).at n=17A105369
• Number of proper divisors of n!.at n=19A153823
• Number of permutations of length n which avoid the patterns 1234 and 2341.at n=9A165540
• Number of (w,x,y,z) with all terms in {1,...,n} and 2|w-x|=|x-y|+|y-z|.at n=35A212575
• Values for b in abc-triples with a=1.at n=40A216323
• Erroneous version of A271811 (but for odd primes only).at n=22A271664
• Consider coefficients U(m,L,k) defined by the identity Sum_{k=1..L} Sum_{j=0..m} A302971(m,j)/A304042(m,j) * k^j * (T-k)^j = Sum_{k=0..m} (-1)^(m-k) * U(m,L,k) * T^k that holds for all positive integers L,m,T. This sequence gives 3-column table read by rows, where the n-th row lists coefficients U(2,n,k) for k = 0, 1, 2; n >= 1.at n=12A316349
• Expansion of x*(31 + 326*x + 336*x^2 + 26*x^3 + x^4) / (1 - x)^6.at n=4A316457
• T(n,k) = k^n + k^(n - 2)*n*(n - 1)*(k*(k - 1) + 1)/2 for 0 < k <= n and T(n,0) = A154272(n+1), square array read by antidiagonals upwards.at n=60A320530
• Odd numbers m such that there exists no k for which the denominator of d(k)/k = m where d(k) is the number of divisors of k (A000005).at n=24A353320
• Numbers whose square and cube taken together contain each decimal digit at least twice.at n=14A363909
• Array read by ascending antidiagonals: A(n,k)=4^k*Sum_{j=1..n} sin(2*j*Pi/(2*n+1))^(2*k).at n=63A376484
• Total number of ways of partitioning n and any natural number less than n into the same number of parts.at n=17A380124
• Numbers k such that k + A067666(k) is a square.at n=31A386257