35644

Appears in sequences

• Numbers m such that 2*phi(m) = phi(m+1).at n=28A050472
• Smallest k such that both k-n and k+n are primes and there are no primes between them.at n=27A087378
• <h[d+1,d-1],s[d,d]*s[d,d]*s[d,d]> where h[d+1,d-1] is a homogeneous symmetric function, s[d,d] is a Schur function indexed by two parts, * represents the Kronecker product and <, > is the standard scalar product on symmetric functions.at n=40A115376
• Number of -1..1 arrays x(i) of n+1 elements i=1..n+1 with x(i)+x(j), x(i+1)+x(j+1), -(x(i)+x(j+1)), and -(x(i+1)+x(j)) having two or three distinct values for every i<=n and j<=n.at n=12A211477
• Sum of the parts in the partitions of 4n into 4 parts with smallest part = 1.at n=18A239056
• Triangle read by rows: T(n,k) is the number of compositions of n having degree of asymmetry equal to k (n>=0; 0<=k<=n/3).at n=65A275433
• a(n) is the smallest number m, such that m+n is the next prime and m-n is the previous prime.at n=26A282690
• Number of multisets of exactly five nonempty words with a total of n letters over n-ary alphabet such that within each prefix of a word every letter of the alphabet is at least as frequent as the subsequent alphabet letter.at n=9A294007