19551
domain: N
Appears in sequences
- Random walks.at n=5A005025
- 4-dimensional analog of centered polygonal numbers.at n=19A006325
- Sums of 3 distinct powers of 7.at n=19A038482
- Number of nonempty subsets of {1,2,...,n} in which exactly 2/3 of the elements are <= sqrt(n).at n=43A048095
- Number of paths along a corridor width 8, starting from one side.at n=17A061551
- Number of (s(0), s(1), ..., s(2n+1)) such that 0 < s(i) < 9 and |s(i) - s(i-1)| = 1 for i = 1,2,...,2n+1, s(0) = 4, s(2n+1) = 5.at n=8A094855
- Number of partitions of triangular numbers n*(n+1)/2 into (n-2) distinct parts for n>=3.at n=16A104384
- a(2*n+1) = 7*a(n), a(2*n+2) = 8*a(n) + a(n-1).at n=39A116554
- Expansion of x/(1 - 9*x + 28*x^2 - 35*x^3 + 15*x^4 - x^5).at n=6A122588
- a(n) = (10*n+3)*(10*n+17).at n=13A152579
- Number of reduced words of length n in the Weyl group A_48.at n=3A161693
- a(n) = n*(n+1)*(20*n-17)/6.at n=18A172117
- Numbers k such that k^2+1 = 2p,(k+1)^2+1 = 5q, (k+2)^2+1 = 10r where p, q, and r are primes.at n=27A181619
- Let i be in {1,2,3,4} and let r >= 0 be an integer. Let p={p_1, p_2, p_3, p_4} = {-3,0,1,2}, n=3*r+p_i, and define a(-3)=0. Then a(n)=a(3*r+p_i) gives the quantity of H_(9,4,0) tiles in a subdivided H_(9,i,r) tile after linear scaling by the factor Q^r, where Q=sqrt(2*cos(Pi/9)).at n=53A187498
- Number of n X 6 binary arrays without the pattern 0 1 diagonally or vertically.at n=7A188840
- Number of -n..n arrays x(0..3) of 4 elements with zero sum, and adjacent elements not both strictly positive and not both strictly negative.at n=22A199899
- Number of (w,x,y,z) with all terms in {1,...,n} and w<=2x and y<=3z.at n=13A212513
- T(n,k)=Number of length (n+k)X1 arrays of occupancy after each element moves up to +-k places including 0.at n=33A222345
- Number of (n+6)X1 arrays of occupancy after each element moves up to +-n places including 0.at n=2A222350
- Numbers D such that D^2 = A^3 + B^4 + C^5 and A^2 + B^3 + C^4 = d^2 for some positive integers A, B, C, d.at n=12A256613