50813

Appears in sequences

• Take pairs (x,y) with Sum_{j = x..y} j = concatenation of x and y. Sort pairs on y then x. This sequence gives x of each pair.at n=43A070152
• Triangle read by rows: T(n,k) is number of paths from (0,0) to (3n,0) that stay in the first quadrant (but may touch the horizontal axis), consisting of steps u=(2,1),U=(1,2), or d=(1,-1) and have k doubledescents (i.e., dd's).at n=48A108428
• Triangle read by rows: T(n,k) is number of paths from (0,0) to (3n,0) that stay in the first quadrant (but may touch the horizontal axis), consisting of steps u=(2,1),U=(1,2), or d=(1,-1) and have k doubledescents (i.e., dd's).at n=51A108428
• Expansion of phi(x^2) / f(-x) in powers of x where phi(), f() are Ramanujan theta functions.at n=36A226622
• Numbers n such that n is the sum of two nonzero squares while n^2 is the sum of two positive cubes.at n=35A273554
• Number of nX3 0..1 arrays with each 1 adjacent to 3, 4 or 6 king-move neighboring 1s.at n=10A297015
• Sum of the squarefree parts of the partitions of n into 6 parts.at n=40A309481
• a(n) = 1 + Sum_{k=1..n-5} a(k) * a(n-k-5).at n=34A346077