19575

Appears in sequences

• a(n) = (6*n+1)*(6*n+3)*(6*n+5).at n=4A001520
• a(n) = (2*n+1)*(2*n+3)*(2*n+5).at n=12A061550
• a(n) = (4*n+1)*(4*n+3)*(4*n+5).at n=6A133766
• Totally multiplicative sequence with a(p) = 8p-1 for prime p.at n=43A166657
• Number of partitions of n such that the number of parts is divisible by the smallest part.at n=36A168657
• Number of 0..26 integer arrays v[1..n] of length n with all autocorrelation values sum(i){v[i]*v[i-k]} distinct for k in 0..n-1.at n=2A171332
• Number of 0..n-1 integer arrays v[1..3] of length 3 with all autocorrelation values sum(i){v[i]*v[i-k]} distinct for k in 0..2.at n=26A171354
• Number of ternary squareful words of length n.at n=9A171761
• Integers n such that 2n^2+1, 2n^3+1 and 2n^4+1 are prime.at n=22A239920
• Number of length n+4 0..6 arrays with no five consecutive elements with pattern ababa or abbba (possibly a=b) and new values 0..6 introduced in 0..6 order.at n=4A244181
• T(n,k)=Number of length n+4 0..k arrays with no five consecutive elements with pattern ababa or abbba (possibly a=b) and new values 0..k introduced in 0..k order.at n=49A244185
• a(n) = 27*(n - 6)^2 + 4*(n - 6)^3 = ((n - 6)^2)*(4*n + 3).at n=21A245032
• Number of n X 2 nonnegative integer arrays with upper left 0 and every value within 2 of its city block distance from the upper left and every value increasing by 0 or 1 with every step right or down.at n=23A252814
• a(n) = a(n-1) + 3*a(n-2) with n>1, a(0)=1, a(1)=6.at n=11A274977
• Numbers m such that there are precisely 17 groups of order m.at n=11A294949
• Number of intersections formed within a triangle by placing n points "in general position" on each of the three sides and connecting each point to each of the points on the other two sides using straight lines.at n=10A365929
• a(n) = n*(n + 2)*(n + 4).at n=25A370912
• Odd numbers k that are closer to being perfect than previous terms and also satisfy the condition that A324644(k)/A324198(k) = 2.at n=6A386422