36667

Appears in sequences

• Number of n-node trees of height at most 5.at n=15A001385
• Numbers whose square has its digits in nondecreasing order.at n=48A028819
• a(1) = 1; sequence of digits of a(n)^2 is a subsequence of the sequence of digits of a(n+1)^2.at n=7A067633
• Duplicate of A067633.at n=7A091874
• a(n) = (11*10^n + 1)/3.at n=4A199690
• Number of n X 3 0..1 arrays with rows and antidiagonals unimodal and columns nondecreasing.at n=36A224141
• Integers n such that digits in n and n^2 are in nondecreasing order.at n=39A234841
• Numbers of the form (10^a + 10^b + 1)/3.at n=19A237424
• Numerators of triangle related to enumeration of minimal 2-covers of a labeled n-set.at n=25A280752
• Number of nX4 0..1 arrays with every element equal to 0, 1, 2, 3, 5 or 7 king-move adjacent elements, with upper left element zero.at n=5A299085
• Number of nX6 0..1 arrays with every element equal to 0, 1, 2, 3, 5 or 7 king-move adjacent elements, with upper left element zero.at n=3A299087
• T(n,k)=Number of nXk 0..1 arrays with every element equal to 0, 1, 2, 3, 5 or 7 king-move adjacent elements, with upper left element zero.at n=39A299089
• T(n,k)=Number of nXk 0..1 arrays with every element equal to 0, 1, 2, 3, 5 or 7 king-move adjacent elements, with upper left element zero.at n=41A299089
• Triangle read by rows: T(m,n) is the label of the largest square that an (m,n)-leaper (a generalization of a chess knight) reaches before it can no longer move, starting on a board with squares spirally numbered, starting at 1; 1 <= n < m. Each move is to the lowest-numbered unvisited square.at n=6A306197
• Numbers k for which rank of the elliptic curve y^2 = x^3 - 432*k^2 is 4.at n=4A309964