65794

Appears in sequences

• Number of forests with n nodes and height at most 2.at n=7A000949
• Numbers that are the sum of 4 nonzero 8th powers.at n=16A003382
• Numbers that are the sum of at most 4 nonzero 8th powers.at n=41A004877
• Numbers whose base-16 representation has exactly 5 runs.at n=1A043678
• Sum of two consecutive primes of the form 2^x+1 (including Fermat primes and 2).at n=4A092733
• Rectangular table, read by antidiagonals, such that the g.f. of row n, R_n(y), satisfies: R_n(y) = [ Sum_{k>=0} y^k * R_{n*k}(y) ]^n for n>=0, with R_0(y)=1.at n=51A124550
• Row 3 of table A124550; also equals the self-convolution cube of A124563, which is row 3 of table A124560.at n=6A124553
• a(n) = Sum_{d|n} phi(n/d)^(d-1).at n=50A164941
• a(n) = 4^n+2^n+2.at n=8A170938
• Triangle read by rows: T(n,k) = number of forests of labeled rooted trees with n nodes and height at most k (n>=1, 0<=k<=n-1).at n=23A210725
• Number of integers in n-th generation of tree T(2^(-1/3)) defined in Comments.at n=46A274158
• a(n) = Sum_{d|n} phi(d)^n.at n=7A342471
• Square array T(n,k), n >= 1, k >= 1, read by antidiagonals, where T(n,k) = Sum_{j=1..n} gcd(j, n)^k.at n=58A343510
• Square array T(n,k), n >= 1, k >= 1, read by antidiagonals downwards, where T(n,k) = Sum_{j=1..n} floor(n/j)^k.at n=58A344725
• Replace 2^k in binary expansion of n with 2^(2^k).at n=25A358126