46475

Appears in sequences

• a(n)=f(n,n-1) where f is given in A034261.at n=7A034274
• a(n) = (8*n+9)*C(n+8,8)/9.at n=7A056122
• Numbers n that are the hypotenuse of exactly 12 distinct integer-sided right triangles, i.e., n^2 can be written as a sum of two squares in 12 ways.at n=17A097226
• Negative value of coefficient of x^(n-2) in the characteristic polynomial of a certain n X n integer circulant matrix.at n=24A127407
• Successive integers produced by Conway's PRIMEGAME using Kilminster's Fractran program with only nine fractions.at n=28A183132
• Number of length 4 0..n arrays with each partial sum starting from the beginning no more than two standard deviations from its mean.at n=13A244835
• Numbers n such that n and n+1 both have 18 divisors.at n=6A274360
• Numbers k such that k and k+1 both have more nonunitary than unitary prime divisors (A348121).at n=40A348122
• Numbers k such that k is a multiple of A005941(k).at n=58A364550
• Odd numbers k such that k is a multiple of A005941(k).at n=9A364551