97888
domain: N
Appears in sequences
- Numbers in Morse code, with 1 for a dot, 2 for a dash and 0 between digits/letters and then converted from base 3 to base 10.at n=26A060110
- G.f.: exp( Sum_{n>=1} (x^n/n)*[Sum_{k=0..[n/2]} A034807(n,k)^n] ), where A034807 is a triangle of Lucas polynomials.at n=6A171186
- Number of (n+1) X (n+1) 0..3 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 3 (constant-stress 1 X 1 tilings).at n=6A235290
- Number of (n+1) X (7+1) 0..3 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 3 (constant-stress 1 X 1 tilings).at n=6A235297
- Consider a non-palindromic number of k digits n = d_(k)*10^(k-1) + d_(k-1)*10^(k-2) + … + d_(2)*10 + d_(1). Sequence lists the numbers n such that Sum_{i=1..k-1}{sigma(Sum_{j=1..i}{d_(j)*10^(j-1)})} = Sum_{i=1..k-1}{sigma(Sum_{j=1..i}{d_(k-j+1)*10^(i-j)})} (see example below).at n=11A241502
- Expansion of Product_{k>=2} (1 + x^k)^k.at n=25A298598
- Number of vertices of even degree in a cubic lattice n X n X n.at n=47A383585