18711

Appears in sequences

• Odd numbers divisible by exactly 7 primes (counted with multiplicity).at n=16A046320
• Composite numbers divisible by the palindromic sum of their prime factors (counted with multiplicity).at n=30A046358
• Odd numbers divisible by the palindromic sum of their prime factors (counted with multiplicity).at n=7A046359
• Composite numbers divisible by the palindromic sum of their palindromic prime factors (counted with multiplicity).at n=17A046366
• Odd numbers divisible by the palindromic sum of its palindromic prime factors (counted with multiplicity).at n=3A046367
• Part of n! composed of prime factors of form 4k+3.at n=12A097707
• Part of n! composed of prime factors of form 4k+3.at n=11A097707
• Let pi be an unrestricted partition of n with the summands written in binary notation. a(n) is the number of such partitions whose binary representation has an odd number of binary ones.at n=40A102437
• Smallest term in the Hofstadter sequence A005243 having exactly n representations as sum of consecutive earlier terms.at n=13A118166
• Triangle read by rows: T(n,k) = number of partitions of [1..k] into n nonempty clumps of sizes 1, 2, 3, 4 or 5 (n >= 0, 0 <= k <= 5n).at n=29A151338
• The triangle in A151338 read by rows downwards.at n=69A151509
• 7 times heptagonal numbers: a(n) = 7*n*(5*n-3)/2.at n=33A152777
• Denominator of Laguerre(n, 10).at n=12A160654
• a(n) = (4*n^3 + n^2 - 3*n)/2.at n=21A172073
• Triangle of numerators of coefficients of the polynomial Q^(2)_m(n) defined by the recursion Q^(2)_0(n)=1; for m>=1, Q^(2)_m(n) = Sum_{i=1..n} i^2*Q^(2)_(m-1)(i). For m>=0, the denominator for all 3*m+1 terms of the m-th row is A202367(m+1).at n=15A175669
• Worpitzky(n, k)*Harmonic(k), triangle read by rows.at n=31A176276
• Number of nX1 0..4 arrays with each element equal to the number its horizontal and vertical neighbors less than or equal to itself.at n=13A196537
• Triangle read by rows: T(n,k) = number of n-element unlabeled N-free posets of height k (1 <= k <= n).at n=48A202181
• Number of n X 1 1..3 arrays with no element with value z exactly a city block distance of z from another element with value z.at n=14A209367
• Trajectory of 80 under the map n-> A006368(n).at n=22A223087