23346

Appears in sequences

• a(n) = n*(n^2 + 1)/2.at n=36A006003
• a(n) = binomial(n,0) - binomial(n,2) + binomial(n,4).at n=29A058923
• Numbers n such that 9*10^n + 5*R_n - 4 is prime, where R_n = 11...1 is the repunit (A002275) of length n.at n=20A103100
• a(n) = 1458*n + 18.at n=15A157505
• n^2*(n^4+1)/2.at n=6A168122
• a(n) is the smallest number which is the sum of two positive n-gonal numbers in more than one way.at n=18A199809
• Number of (n+1) X 3 0..2 arrays with every 2 X 3 or 3 X 2 subblock having exactly three counterclockwise and three clockwise edge increases.at n=4A206144
• Number of (n+1) X 6 0..2 arrays with every 2 X 3 or 3 X 2 subblock having exactly three counterclockwise and three clockwise edge increases.at n=1A206147
• T(n,k) = number of (n+1) X (k+1) 0..2 arrays with every 2 X 3 or 3 X 2 subblock having exactly three counterclockwise and three clockwise edge increases.at n=16A206150
• T(n,k) = number of (n+1) X (k+1) 0..2 arrays with every 2 X 3 or 3 X 2 subblock having exactly three counterclockwise and three clockwise edge increases.at n=19A206150
• a(n) = (n^n + n^2)/2.at n=5A214647
• T(n,k)=Number of nXk 0..2 arrays with no element x(i,j) adjacent to value 2-x(i,j) horizontally, diagonally or antidiagonally.at n=33A232920
• Number of 6Xn 0..2 arrays with no element x(i,j) adjacent to value 2-x(i,j) horizontally, diagonally or antidiagonally.at n=2A232925
• Number of (m1,m2,n1,n2) in {0,1,...,n}^4 such that gcd(X^m1 + (1+X)^n1, X^m2 + (1+X)^n2) = 1 over GF(2).at n=11A245488
• Row sums of the triangular array A246696.at n=35A246697
• Numbers k such that 7*10^k + 87 is prime.at n=23A274911
• a(n) = (n - 1)*(4*n^2 - 8*n + 5).at n=18A317297
• The number of partitions of n without repeated odd parts having more even parts than odd parts.at n=52A340623
• a(n) = Sum_{d|n} phi(d)^4.at n=27A342470
• Primitive terms of A108569.at n=20A346277