46593

Appears in sequences

• Numbers that are the sum of 3 positive cubes in exactly 3 ways.at n=36A025397
• Numbers that are the sum of 3 distinct positive cubes in exactly 3 ways.at n=31A025401
• Numbers that are the sum of 3 distinct positive cubes in 3 or more ways.at n=34A025402
• a(n) = T(7,n), array T given by A048471.at n=6A036548
• 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, 0), (-1, 0, 1), (1, 0, 1), (1, 1, -1)}.at n=10A148824
• a(n) = 6^n - 2^n + 1.at n=6A155597
• Triangle read by rows: T(n,k) is the number of weighted lattice paths in B(n) having k valleys. The members of B(n) are paths of weight n that start at (0,0), end on but never go below the horizontal axis, and whose steps are of the following four kinds: an (1,0)-step with weight 1, an (1,0)-step with weight 2, a (1,1)-step with weight 2, and a (1,-1)-step with weight 1. The weight of a path is the sum of the weights of its steps. A valley is a (1,-1)-step followed by a (1,1)-step.at n=39A182900
• Number of 0..n arrays of length 5 with each element differing from at least one neighbor by 1 or less.at n=29A221597
• Numbers n such that (n(n+1)/2) modulo sigma(n) = n.at n=16A232538
• Numbers n such that floor(antisigma(n) / sigma(n)) = floor(antisigma(n+1) / sigma(n+1)).at n=15A244666
• Numbers k such that sigma(k)^2 is divisible by k-1.at n=37A344347
• Square array T(n,k), n >= 1, k >= 1, read by antidiagonals downwards, where T(n,k) = Sum_{j=1..n} (-1)^(j+1) * floor(n/(2*j-1))^k.at n=60A350161
• a(n) = Sum_{k=1..n}(-1)^(k+1) * floor(n/(2*k-1))^n.at n=5A350164