39648
domain: N
Appears in sequences
- Tetranacci numbers: a(n) = a(n-1) + a(n-2) + a(n-3) + a(n-4) for n >= 4 with a(0) = a(1) = a(2) = 0 and a(3) = 1.at n=20A000078
- Expansion of e.g.f.: cosh(arctanh(x)*log(x+1)) = 1+12/4!*x^4-60/5!*x^5+570/6!*x^6...at n=8A012706
- Triangle T(n,k) read by rows ; multiply row n of Pascal's triangle (A007318) by A024175(n).at n=38A120493
- Triangle T(n,k) read by rows ; multiply row n of Pascal's triangle (A007318) by A024175(n).at n=42A120493
- Numbers in A075728 which are not one less than some prime.at n=31A179232
- Number of nondecreasing arrangements of 7 numbers x(i) in -(n+5)..(n+5) with the sum of sign(x(i))*x(i)^2 zero.at n=13A188007
- Triangle read by rows: T(n,k) is the number of dispersed Dyck paths of length n (i.e., Motzkin paths of length n with no (1,0)-steps at positive heights) having k DHU's (here U=(1,1), H=(1,0), and D=(1,-1)).at n=57A191397
- a(n) = n*(n^2 + 3*n - 2)/2.at n=42A256857
- Indices of rows of triangle A262432 where the maximum term of the row is a new record.at n=33A262464
- Modified quadranacci series.at n=52A274759
- a(n) is the least k such that the average number of bi-unitary divisors of {1..k} is >= n.at n=8A344273
- a(n) is the smallest tetranacci number (A000078) with exactly n distinct prime factors.at n=4A359849
- a(n) is the smallest Fibonacci n-step number with exactly n distinct prime factors.at n=2A359852
- a(n) is the smallest tetranacci number (A000078) with exactly n prime factors (counted with multiplicity).at n=8A359877
- Number of compositions (ordered partitions) of n into parts not greater than sqrt(n).at n=17A364526