30060

Appears in sequences

• a(n) = sum of lengths of strings that can be generated by any starting string of n 2's and 3's that starts with a 2, using the rule described in the Comments lines.at n=11A093369
• Numbers k such that k and k^2 use only the digits 0, 1, 3, 6 and 9.at n=56A136850
• Numbers k such that k and k^2 use only the digits 0, 2, 3, 6 and 9.at n=21A136894
• Numbers k such that k and k^2 use only the digits 0, 3, 4, 6 and 9.at n=26A136932
• Numbers k such that k and k^2 use only the digits 0, 3, 5, 6 and 9.at n=20A136939
• Numbers k such that k and k^2 use only the digits 0, 3, 6, 7 and 9.at n=20A136944
• Numbers k such that k and k^2 use only the digits 0, 3, 6, 8 and 9.at n=31A136945
• Numbers k such that k and k^2 use only the digits 0, 3, 6 and 9.at n=20A136946
• Sums of 2 distinct primorials.at n=17A177689
• Numbers that are the sum of distinct primorial numbers (A002110) (not including 1).at n=35A290249
• Numbers that are not Keith numbers in any base.at n=40A320122
• Numbers k such that k*A001414(k)+1 is the square of a prime.at n=25A343141
• Triangle read by rows: T(n,k) = A002110(n) + A002110(k), 0 <= k <= n; sums of two primorials, not necessarily distinct.at n=24A370121
• Triangle read by rows: T(n,k) = A002110(n) + A002110(k), 1 <= k <= n; sums of two primorials > 1, not necessarily distinct.at n=17A370134