42524

Appears in sequences

• Aliquot sequence starting at 660.at n=13A014362
• a(n) = n*(n^4 + 10*n^3 + 35*n^2 + 50*n + 144)/120.at n=19A051745
• Number of primitive (aperiodic) word structures of length n which contain exactly five different symbols.at n=9A056281
• Number of primitive (aperiodic) palindromic structures using exactly five different symbols.at n=19A056484
• Triangle read by rows: T(n,k) is the number of primitive (aperiodic) word structures of length n using exactly k different symbols.at n=49A137651
• Number of binary strings of length n with equal numbers of 0001 and 0111 substrings.at n=17A164160
• Sequence defined by the recurrence formula a(n+1)=sum(a(p)*a(n-p)+k,p=0..n)+l for n>=1, with here a(0)=1, a(1)=4, k=-1 and l=0.at n=8A176858
• Number of (n+2)X(4+2) 0..1 arrays with each 3X3 subblock having clockwise perimeter pattern 00000000 or 00000001.at n=5A259638
• Number of (n+2)X(6+2) 0..1 arrays with each 3X3 subblock having clockwise perimeter pattern 00000000 or 00000001.at n=3A259640
• T(n,k)=Number of (n+2)X(k+2) 0..1 arrays with each 3X3 subblock having clockwise perimeter pattern 00000000 or 00000001.at n=39A259642
• T(n,k)=Number of (n+2)X(k+2) 0..1 arrays with each 3X3 subblock having clockwise perimeter pattern 00000000 or 00000001.at n=41A259642
• Solution of the complementary equation a(n) = a(n-1) + a(n-2) + b(n-2) + n, where a(0) = 1, a(1) = 3, b(0) = 2, b(1) = 4.at n=18A293349