100656
domain: N
Appears in sequences
- Triangle read by rows, the inverse Bell transform of n!*binomial(4,n) (without column 0).at n=16A011801
- Positive numbers k such that k and 6*k are anagrams in base 7 (written in base 7).at n=8A023072
- a(n) = Sum_{k=0..floor(n/2)} A026637(n-k, k).at n=24A026647
- Expansion of 3*x/(1 - 2*x^2 - 2*x + x^3).at n=12A120718
- Amicable triples: numbers such that sigma(x) = sigma(y) = sigma(z) = x+y+z, x<y<z. We order these triples according to the common value of sigma. Sequence gives z numbers.at n=20A125492
- Numbers k such that k and k^2 use only the digits 0, 1, 3, 5 and 6.at n=34A136843
- Second column (m=2) of triangle S2p(-4) = A011801.at n=4A144347
- Number of n-node unlabeled rooted trees with thinning limbs and root outdegree (branching factor) 8.at n=15A244709
- a(n) = a(n-1) + a(n-3) + a(n-4), where a(0) = 0, a(1) = 1, a(2) = 0, a(3) = 2.at n=26A295681
- a(n) = a(n-1) + a(n-3) + a(n-4), where a(0) = 0, a(1) = 2, a(2) = 0, a(3) = 1.at n=26A295682
- a(n) = F(n)*F(n+1) mod L(n+2) where F=A000045 is the Fibonacci numbers and L = A000032 is the Lucas numbers.at n=23A348592