32188

Appears in sequences

• a(n) = floor(10000*log(n)).at n=24A004243
• Indices of primes in sequence defined by A(0) = 71, A(n) = 10*A(n-1) + 21 for n > 0.at n=23A101137
• Transform of the finite sequence (1, 0, -1) by the T_{0,1} transformation (see link).at n=12A159340
• Numbers n, not divisible by 3, 5, 7 or 11, such that A000203(n)-n-1 and 2*n+1-A000203(n) are prime numbers.at n=12A180268
• Capped binary boundary codes for holeless strictly non-overlapping polyhexes (all orientations and rotations included).at n=38A258002
• Capped binary boundary codes for holeless strictly non-overlapping polyhexes, only the maximal representative from each equivalence class obtained by rotating.at n=6A258003
• Capped binary boundary codes for holeless strictly non-overlapping polyhexes with bilateral symmetry, only the maximal representative from each equivalence class obtained by rotating.at n=6A258005
• Capped binary boundary codes for fusenes (all orientations and rotations included).at n=38A258012
• Capped binary boundary codes for fusenes, only the maximal representatives of each equivalence class obtained by rotating.at n=6A258013
• Capped binary boundary codes for those fusenes that stay same when flipped over, only the maximal representative from each equivalence class up to rotation.at n=6A258015
• Padovan like sequence: a(n) = a(n-2) + a(n-3) for n>3, a(1)=2, a(2)=2, a(3)=0.at n=37A276275
• Number of partitions of n in which exactly one even part is repeated and odd parts are unrestricted.at n=42A353902
• a(n) = Sum_{k=0..n} binomial(3*n, n-k) * q(k), where q(k) is the number of partitions into distinct parts (A000009).at n=6A356283
• Number of subsets of {1..n} such that some element can be written as a nonnegative linear combination of the others.at n=15A364914