35620

Appears in sequences

• Number of partitions of n that do not contain 2 as a part.at n=47A027336
• Numbers that appear exactly five times in A101402. (Also indices of fives in A101403.).at n=24A129117
• Triangle read by rows: T(n,k) is the number of permutations of [n] having k adjacent transpositions (0 <= k <= floor(n/2)). An adjacent transposition is a cycle of the form (i, i+1).at n=26A177248
• a(0)=0: a(n)=A002865(2*n)+A002865(2*n+1), n>=1.at n=23A182844
• Number of (n+1)X(2+1) 0..2 arrays colored with the upper median plus the lower median minus the minimum of every 2X2 subblock.at n=2A237679
• Number of (n+1)X(3+1) 0..2 arrays colored with the upper median plus the lower median minus the minimum of every 2X2 subblock.at n=1A237680
• T(n,k)=Number of (n+1)X(k+1) 0..2 arrays colored with the upper median plus the lower median minus the minimum of every 2X2 subblock.at n=7A237683
• T(n,k)=Number of (n+1)X(k+1) 0..2 arrays colored with the upper median plus the lower median minus the minimum of every 2X2 subblock.at n=8A237683
• Number of partitions p of n such that 1 + (1/2)*max(p) is a part of p.at n=50A238625
• Numbers n such that 13^n is the highest power of 13 dividing A240751(n).at n=17A286007
• Practical numbers z such that z^2 = x^2 + y^2 for some practical numbers x and y with gcd(x,y,z) = 4.at n=47A294112
• a(0) = 1; a(n) = (1/n) * Sum_{k=1..n} binomial(n,k)^2 * k * 5^(k-1) * a(n-k).at n=5A337595
• Number of Baxter 3-permutations of length n.at n=6A356197
• Number of permutations of [n] having exactly one adjacent 2-cycle.at n=9A370524
• Triangle read by rows: T(n,k) = number of permutations of [n] having exactly one adjacent k-cycle. (n>=1, 1<=k<=n).at n=37A370527
• a(n) is the number of subsets x of Z_n such that #x * #y = n and x + y = Z_n for some subset y of Z_n.at n=27A374770