126656

Appears in sequences

• a(n) = number of strings of length n that can be obtained by starting with abc and repeatedly doubling any substring in place.at n=14A135473
• Number of length 4 1..(n+1) arrays with every leading partial sum divisible by 2, 3, 5 or 7.at n=23A258635
• G.f. A(x) satisfies A(x) = 1 / (1 - x - x * A(x^4)).at n=16A367660