35190

Appears in sequences

• Number of n-step mappings with 4 inputs.at n=23A005945
• Expansion of Product_{m>=1} (1+x^m)^2.at n=34A022567
• a(n) = number of (s(0), s(1), ..., s(2n)) such that s(i) is a nonnegative integer and |s(i) - s(i-1)| = 1 for i = 1,2,...,n, s(0) = 2, s(2n) = 4. Also a(n) = T(2n,n-1), where T is the array defined in A026009.at n=8A026013
• a(n) = (2*n+1)*(3*n+1)*(4*n+1).at n=11A033591
• T(n,k) = S(2n,n-1,k-1), 0 <= k <= n, n >= 0, array S as in A050157.at n=48A050160
• T(n, k) = S(2n+2, n+2, k+2) for 0<=k<=n and n >= 0, array S as in A050157.at n=38A050163
• Sequence of sums based on primes = 7 mod 8.at n=39A060108
• (Prime(prime(n))^2-1)/24.at n=35A092772
• Triangle T, read by rows, where column k equals column k of T^(2^k) shift down 1 row, with T(n,n)=T(n+1,n)=1 for n>=0.at n=39A121395
• One-half of averages of twin prime pairs of A001318.at n=20A154565
• Expansion of b(2)*b(4)*b(6)/(x^8-x^4-x+1), where b(k) = (1-x^k)/(1-x).at n=30A265055
• Those primitive elements of A337386 that have exactly one primitive nondeficient divisor (A006039).at n=14A341604
• Even numbers 2m such that A352612(2m) = A103131(2m).at n=40A352587