35805

Appears in sequences

• a(n) = (6*n+1)*(6*n+3)*(6*n+5).at n=5A001520
• Numbers k such that sigma(k) = sigma(k+9).at n=6A015877
• Number of partitions of n into parts not of the form 11k, 11k+5 or 11k-5. Also number of partitions with at most 4 parts of size 1 and differences between parts at distance 4 are greater than 1.at n=48A035948
• Odd numbers with exactly 5 distinct prime factors.at n=9A046391
• Smaller of Smith brothers.at n=18A050219
• a(n) = (2*n+1)*(2*n+3)*(2*n+5).at n=15A061550
• a(n) = (5*n+1)*(5*n+3)*(5*n+5).at n=6A079610
• Odd squarefree abundant numbers.at n=9A112643
• Number of permutations of length n which avoid the patterns 1423, 1432, 3241.at n=9A116790
• Triangle read by rows: T(n,k) is the number of partitions of the set {1,2,...,n}, having exactly k blocks consisting only odd entries (0<=k<=ceiling(n/2)).at n=37A124420
• Triangle read by rows: T(n,k) is the number of partitions of the set {1,2,...,n}, having exactly k blocks consisting only even entries (0<=k<=floor(n/2)).at n=32A124422
• Odd infinitary abundant numbers.at n=27A127666
• Odd unitary abundant numbers.at n=9A129485
• Number of degree-n permutations such that number of cycles of size 2k is odd (or zero) for every k.at n=8A130275
• a(n) = (4*n+3)*(4*n+5)*(4*n+7).at n=7A133767
• Smallest order of the cyclotomic polynomial whose maximal coefficient in absolute value is n.at n=33A136418
• Odd squarefree numbers n such that the cyclotomic polynomial Phi(n,x) is not coefficient convex.at n=15A146960
• The hyper-Wiener index of the Kneser graph K(n,2) (n>=5).at n=17A228307
• Number of ways to place 3 points on a triangular grid of side n so that no two of them are adjacent.at n=9A239569
• Primitive, odd, squarefree abundant numbers.at n=9A249263