26790
domain: N
Appears in sequences
- Number of digits in n-th even perfect number (A000396).at n=26A061193
- Number of partitions of n such that the least part occurs exactly four times.at n=51A097092
- Triangle read by rows: T(n,k) = round(c(n)/(c(k)*c(n-k))) where c are partial products of a sequence defined in comments.at n=38A172364
- Triangle read by rows: T(n,k) = round(c(n)/(c(k)*c(n-k))) where c are partial products of a sequence defined in comments.at n=42A172364
- Where records occur in A217287.at n=24A217289
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 453", based on the 5-celled von Neumann neighborhood.at n=34A272275
- Expansion of Product_{k>=1} ((1-x^(5*k))/(1-x^k))^k.at n=18A285263
- Solution of the complementary equation a(n) = a(n-1) + a(n-2) + b(n-2)^2, where a(0) = 1, a(1) = 2, b(0) = 3, and (a(n)) and (b(n)) are increasing complementary sequences.at n=15A296257
- Numbers k such that F(k)*F(k+1) + F(k+2) is a prime, where F = A000045 (Fibonacci numbers).at n=33A305414
- Indices of record high values in A061836.at n=33A333533
- Coefficient of x^n in the expansion of ( (1+x) * (1+x+x^3)^2 )^n.at n=6A370186
- a(n) = Sum_{k=0..floor(n/3)} binomial(n-3*k,floor(k/3)).at n=58A376696