49335

Appears in sequences

• a(n) = 2*(3*n)! / ((2*n+1)!*(n+1)!).at n=9A000139
• Numbers k such that phi(k) = phi(k+1).at n=29A001274
• a(n) = floor(binomial(n,6)/6).at n=27A011852
• a(n) = T(n,n-3), where T is the array in A026374.at n=43A026382
• Odd numbers divisible by the palindromic sum of their prime factors (counted with multiplicity).at n=15A046359
• Odd numbers with exactly 5 distinct prime factors.at n=18A046391
• Number of nonempty subsets of {1,2,...,n} in which exactly 5/6 of the elements are <= (n-1)/2.at n=27A047181
• Number of nonempty subsets of {1,2,...,n} in which exactly 5/6 of the elements are <= (n-2)/2.at n=27A047192
• Number of nonempty subsets of {1,2,...,n} in which exactly 4/5 of the elements are <= n/3.at n=33A048000
• Number of nonempty subsets of {1,2,...,n} in which exactly 4/5 of the elements are <= (n-1)/3.at n=33A048013
• Number of nonempty subsets of {1,2,...,n} in which exactly 4/5 of the elements are <= (n+1)/3.at n=33A048046
• Column 2 of triangle A055907.at n=39A055908
• Squarefree numbers k such that phi(k) = phi(k+1).at n=14A063739
• Array read by antidiagonals: T(r,n) = number of two-stack sortable r-permutations.at n=44A093346
• Triangle read by rows: T(n,k) is the number of permutations p of [n] such that the length of the longest 2-stack sortable initial segment of p is equal to k.at n=44A094785
• Smallest order of the cyclotomic polynomial whose maximal coefficient in absolute value is n.at n=30A136418
• Numbers k such that k and k^2 use only the digits 2, 3, 4, 5 and 9.at n=15A137070
• Square array read by upwards antidiagonals: T(m,n) is the number of simple 3-connected triangulations of a closed region in the plane with m+3 given external edges and 3n+m internal edges, m>=0, n>=1.at n=53A210664
• Integers n such that 2n^2+1, 2n^3+1 and 2n^4+1 are prime.at n=39A239920
• Integers n such that 2n^2+1, 2n^3+1, 2n^4+1 and 2n^5+1 are prime.at n=4A239925