23864

Appears in sequences

• a(1) = 1, a(2) = 4; for n > 2, a(n) = k*a(n-1) + 1 where k is smallest number > 1 such that k*a(n-1) + 1 is a multiple of n.at n=7A069563
• Leading term of n-th row of A081491.at n=42A081490
• a(n) = (5*n+2)*(5*n+7).at n=30A085036
• Rectangular array: (row n) = b**c, where b(h) = h, c(h) = binomial(2*n-4+2*h,n-2+h), n>=1, h>=1, and ** = convolution.at n=40A213853
• a(n) = 2*( a(n-5) + a(n-8) + a(n-11) ) for n >= 12.at n=43A226592
• Integers that are Rhonda numbers to base 30.at n=19A255736
• p*B_(p-1)+1 modulo p^2, where p = prime(n) and B_i denotes the i-th Bernoulli number.at n=36A268000
• Number of compositions (ordered partitions) of n into an odd number of squares.at n=33A339419
• a(n) = (prime(n)+1) * prime(n+1).at n=35A345727