36465

Appears in sequences

• Octagonal pyramidal numbers: a(n) = n*(n+1)*(2*n-1)/2.at n=32A002414
• Odd numbers with exactly 5 distinct prime factors.at n=10A046391
• a(n) = a(n-1) + a(m) for n >= 4, where m = 2*n - 2 - 2^(p+1) and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = a(2) = 1 and a(2) = 4.at n=39A050039
• a(n) = C(n)*(12n+1) where C(n) = Catalan numbers (A000108).at n=7A050491
• a(n) = (2*n+9)!!/9!!, related to A001147 (odd double factorials).at n=4A051583
• Expansion of (1+5*x)/(1-x)^10.at n=7A055848
• a(n) is the smallest positive integer m for which A070194(m) (i.e., the maximal gap in {k|gcd(k,m) = 1, 1 <= k <= m-1}) is n.at n=8A070971
• Numerators of inverse unimodal analog of binomial coefficients: binomial(n,m) = Sum_{k=0..n-m} a(2*k+m-1, 2*k).at n=58A072285
• Smallest x such that A061498(x)=n: least number in dRRS of which n distinct term occur.at n=9A076362
• Duplicate of A070971.at n=8A076365
• a(n) = (n+1)*(2*n+1)*(4*n+1).at n=16A079588
• Smallest deficient number with n distinct prime factors.at n=4A087234
• Numbers with exactly one arithmetic progression of four successive divisors (not necessarily consecutive).at n=24A094530
• Eighth column (m=7) of (1,6)-Pascal triangle A096956.at n=9A097298
• Structured icosidodecahedral numbers.at n=16A100147
• Integers that are Rhonda numbers to base 16.at n=14A100975
• Divide n! repeatedly by i! for i from floor(n/2) down through 2; a(n) = remaining quotient.at n=17A111866
• An invertible triangle of ratios of double factorials.at n=50A112292
• Denominator of -16/((n+2)*n*(n-2)*(n-4)).at n=14A117465
• Least k such that the Jacobsthal function A048669(k) = n.at n=8A128759