27200

Appears in sequences

• Number of ways of writing n as a sum of 6 squares.at n=39A000141
• Pisot sequence T(3,5).at n=23A020745
• Pisot sequence T(5,8), a(n) = floor(a(n-1)^2/a(n-2)).at n=22A020749
• Iterated procedure 'composite k added to sum of its prime factors reaches a prime' yields 1 skipped prime.at n=17A050768
• Expansion of 1/((1-x)*(1-x-x^3)).at n=25A077868
• Number of permutations satisfying -k<=p(i)-i<=r and p(i)-i not in I, i=1..n, with k=3, r=3, I={-1,0,1}.at n=22A079985
• Expansion of 1/sqrt((1-2*x)^2-8*x^4).at n=11A113180
• Column 3 of triangle A123610.at n=14A123613
• Number of different ways n! can be represented as the difference of two squares; also, for n >= 4, half the number of positive integer divisors of n!/4.at n=20A138196
• Number of permutations of floor(i*5/2), i=0..n-1, with all sums of 3 adjacent terms unique.at n=7A152317
• Number of permutations of floor(i*9/4), i=0..n-1, with all sums of 3 adjacent terms unique.at n=7A152328
• 8 times octagonal numbers: 8*n*(3*n-2).at n=34A153808
• P_n(4) (see A155100).at n=5A156076
• Triangle T(n, k) = coefficients of (p(x,n)), where p(x, n) = (n-1)! * Sum_{j=1..n} A142458(n, j)*binomial(x+j-1, n-1), read by rows.at n=18A168295
• Numbers with 42 divisors.at n=24A175750
• Numbers of the form p^6*q^2*r where p, q, and r are distinct primes.at n=22A179703
• Triangle read by rows, T(n,k) for 0<=k<=n, generalizes the Motzkin lattice paths with weights of A003645.at n=40A201639
• Number of n X 5 0..1 arrays avoiding 0 0 0 and 1 1 1 horizontally and 0 0 1 and 0 1 1 vertically.at n=8A208066
• a(n) = 17*n^2.at n=40A244630
• Number of nonisomorphic proper colorings of partition multicycle graph using six colors.at n=75A298266