18755

Appears in sequences

• The partition function G(n,4).at n=9A001681
• Number of partitions of n into parts not of the form 17k, 17k+8 or 17k-8. Also number of partitions with at most 7 parts of size 1 and differences between parts at distance 7 are greater than 1.at n=39A035969
• Sums of 3 distinct powers of 5.at n=31A038475
• Numbers k that divide 7^k + 3^k.at n=27A045586
• a(n) = Jacobsthal(n) * Fibonacci(n).at n=10A093042
• Coefficients of the C-Rogers mod 14 identity.at n=45A105782
• Numbers k such that F(2*k + 1) is prime where F(m) is a Fibonacci number.at n=29A117517
• Number of n X n binary arrays with all ones connected only in a 0100-1111-0010 pattern in any orientation.at n=7A146365
• Number of n X n binary arrays symmetric under horizontal and vertical reflection with all ones connected only in a 0100-1111-0010 pattern in any orientation.at n=16A146367
• Number of n X n binary arrays symmetric under horizontal and vertical reflection with all ones connected only in a 0100-1111-0010 pattern in any orientation.at n=17A146367
• Number of n-digit 8th powers.at n=38A216658
• Number G(n,k) of set partitions of {1,...,n} into sets of size at most k; triangle G(n,k), n>=0, 0<=k<=n, read by rows.at n=49A229223
• The number of tilings of a triangular shape T_n with n rectangles identifying all tilings which use the same rectangular shapes.at n=15A247139
• Expansion of Product_{k>=1} (1 - k*x^k)^k.at n=16A266964
• Somos's sequence {b(9,n)} defined in comment in A078495: a(0)=a(1)=...=a(20)=1; for n>=21, a(n)=(a(n-1)*a(n-20)+a(n-10)*a(n-11))/a(n-21).at n=48A272038
• Number of partitions of an n-set into blocks of size <= n/2.at n=9A368503
• Numbers k such that A372692(k) = A372692(k+1) > 1.at n=1A372693
• a(n) is the smallest number which can be represented as the sum of n distinct nonzero fourth powers in exactly 2 ways, or -1 if no such number exists.at n=6A374579
• Numbers k such that (prime(j)-1)^2 + 1 is prime for k <= j <= k + 2.at n=16A376522