44919

Appears in sequences

• Powers of rooted tree enumerator.at n=27A000439
• Triangle read by rows: T(n,k) is the number of Dyck paths of semilength n having k UUDD's starting at level 0; here U=(1,1), D=(1,-1) (0<=k<=floor(n/2)).at n=36A114486
• Number of Dyck paths of semilength n having no UUDD's starting at level 0.at n=11A114487
• 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, 1), (-1, 1, 0), (0, 1, 0), (1, -1, 0), (1, 1, -1)}.at n=11A148190
• Numbers n which appear at least twice in A037278(n), concatenation of their divisors written in base 10.at n=39A248323
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 617", based on the 5-celled von Neumann neighborhood.at n=33A273248
• Numbers such that k is the altitude of a Heronian triangle with sides m-13, m, m+13.at n=18A293846
• Numbers that can be written as the sum of four or more consecutive squares in more than one way.at n=34A307937