23430
domain: N
Appears in sequences
- a(n) = T(n,n-4), T given by A026584. Also a(n) = number of integer strings s(0),...,s(n) counted by T, such that s(n)=4.at n=10A026589
- G.f. A(x) satisfies A(x/A(x)^5) = 1 + x ; thus A(x) = 1 + series_reversion(x/A(x)^5).at n=5A120976
- a(n) is the smallest number m such that phi(m)+sigma(m)=n*pi(m).at n=23A145747
- Numerator of Euler(n, 6/17).at n=4A156597
- Half the number of length n integer sequences with sum zero and sum of squares 5000.at n=3A157582
- Triangle t(n,k) read by rows: fibonomial ratios c(n)/(c(k)*c(n-k)) where c are partial products of a generalized Fibonacci sequence with multiplier m=7.at n=24A172352
- p-INVERT of the positive integers, where p(S) = 1 - 6*S.at n=4A291033
- a(n) = 27^n * Sum_{k=0..n} binomial(-1/3, k)^2.at n=3A367333