32361

Appears in sequences

• Number of discordant permutations.at n=18A000561
• Denominators of cosecant numbers: -2*(2^(2*n-1)-1)*Bernoulli(2*n).at n=33A001897
• Long leg of primitive Pythagorean triangles having legs that add up to a square, sorted on hypotenuse.at n=23A089548
• a(n) = Product_{p-1 divides n} p, where p is an odd prime.at n=66A141459
• Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 1), (-1, 1, 0), (0, 1, -1), (1, 0, 1)}.at n=10A148778
• Let (n)_p denote the exponent of prime p in the prime power factorization of n. Then a(n) is defined by the formulas a(1)=1; for n >= 2, (a(n))_2 = (n)_2, (a(n))_3 = (n)_3 and, for p >= 5, (a(n))_p = 1 + ((2n)/(p-1))_p if p-1|2*n, and (a(n))_p = 0 otherwise.at n=32A202318
• Numbers such that sigma(phi(tau(n)))=tau(phi(sigma(n))).at n=34A226119
• a(n) is the least positive integer k such that 2^n-1 and k^n-1 are relatively prime.at n=65A260119
• a(n) = Sum_{k=0..n} binomial(3*k+1,k).at n=6A263134
• Number of (n+1)X(6+1) arrays of permutations of 0..n*7+6 with each element having directed index change 0,1 0,-1 0,2 1,0 or -1,0.at n=1A264255
• T(n,k)=Number of (n+1)X(k+1) arrays of permutations of 0..(n+1)*(k+1)-1 with each element having directed index change 0,1 0,-1 0,2 1,0 or -1,0.at n=22A264257
• Number of (2+1)X(n+1) arrays of permutations of 0..n*3+2 with each element having directed index change 0,1 0,-1 0,2 1,0 or -1,0.at n=5A264258
• p-INVERT of (1,1,1,1,1,...), where p(S) = 1 - S^3 - S^6.at n=15A290997
• a(n) = n * (binomial(n + 1, 3) + 1).at n=21A329523
• Numbers which are the product of two S-primes (A057948) in exactly three ways.at n=34A343828
• Number of solutions to x^2 + y^2 + z^2 + w^2 <= n^2, where x, y, z, w are positive odd integers.at n=36A349611
• Numbers whose decimal representation is the reverse of their base-7 representation.at n=11A359224