70438

Appears in sequences

• Triangle T read by rows: T(m,n) = number of convex polyominoes with an m+1 X n+1 minimal bounding rectangle, m > 0, n <= m.at n=13A093118
• Let spm(n) be the sum of all prime factors of n counted with multiplicities (A001414); sequence gives numbers n such that spm(n+spm(n)) divides both n and n+spm(n).at n=25A131564
• p-INVERT of (1,2,3,5,7,11,13,...); i.e., 1 and the primes (A008578), where p(S) = 1 - S - S^2.at n=9A289928
• The number of convex polyominoes whose smallest bounding rectangle has size w*h (w > 0, h > 0). The table is read by antidiagonals.at n=49A324009
• The number of convex polyominoes whose smallest bounding rectangle has size w*h (w > 0, h > 0). The table is read by antidiagonals.at n=50A324009
• Number of weakly alternating compositions of n.at n=20A349052