39450

Appears in sequences

• Values of n such that N=(an+1)(bn+1)(cn+1) is a 3-Carmichael number (A087788), where a,b,c = 1,2,33.at n=9A064253
• Number of strings of numbers x(i=1..7) in 0..n with sum i^2*x(i)^2 equal to n^2*49.at n=16A184245
• Number of (n+1)X4 0..2 arrays with every 2 X 2 subblock having the same number of clockwise edge increases as its horizontal neighbors and no 2 X 2 subblock having the same number of counterclockwise edge increases as its vertical neighbors.at n=3A205731
• T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with every 2 X 2 subblock having the same number of clockwise edge increases as its horizontal neighbors and no 2 X 2 subblock having the same number of counterclockwise edge increases as its vertical neighbors.at n=18A205736
• Number of 5X(n+1) 0..2 arrays with every 2 X 2 subblock having the same number of clockwise edge increases as its horizontal neighbors and no 2 X 2 subblock having the same number of counterclockwise edge increases as its vertical neighbors.at n=2A205740
• O.g.f.: exp( Sum_{n>=1} -(sigma(2*n^2) - sigma(n^2)) * (-x)^n/n ).at n=33A215603
• Number of (n+4) X 8 0..2 matrices with each 5 X 5 subblock idempotent.at n=6A224621
• Number of (n+4) X 11 0..2 matrices with each 5 X 5 subblock idempotent.at n=3A224624
• Number of (n+2)X(6+2) 0..1 arrays with every 3X3 subblock sum of the two medians of the central row and column plus the two sums of the diagonal and antidiagonal nondecreasing horizontally, vertically and ne-to-sw antidiagonally.at n=16A259004
• a(n) is the number of edges formed by n-secting the angles of a decagon.at n=30A335802
• a(n) is the smallest number that can be partitioned into n ways as the sum of two brilliant numbers (A078972).at n=35A338474
• a(n) is the least k such that A127064(k) = n.at n=29A378417
• a(n) = Sum_{k=0..floor(n/3)} (-1)^k * (4*k+1) * binomial(3*n-5*k+1,n-3*k)/(3*n-5*k+1).at n=8A390517