62468

Appears in sequences

• a(n) = 10000*n + 2468.at n=6A102689
• 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, 0), (1, 0, -1), (1, 1, 0), (1, 1, 1)}.at n=8A150927
• Number of binary strings of length n that are "prefix heavy", meaning that the fraction of "1" bits in any nonempty prefix is at least as great as the fraction of "1" bits in the entire string.at n=20A298072