a(n) = the number of occurrences of 1 in all compositions of n without 2's = # of occurrences of the integer k in compositions of n+k-1 without 2's (k > 2).

A079662

a(n) = the number of occurrences of 1 in all compositions of n without 2's = # of occurrences of the integer k in compositions of n+k-1 without 2's (k > 2).

Terms

    a(0) =1a(1) =2a(2) =3a(3) =6a(4) =13a(5) =26a(6) =50a(7) =96a(8) =184a(9) =350a(10) =661a(11) =1242a(12) =2324a(13) =4332a(14) =8047a(15) =14902a(16) =27521a(17) =50700a(18) =93191a(19) =170942a(20) =312974a(21) =572030a(22) =1043852a(23) =1902044a(24) =3461067a(25) =6289972a(26) =11417576a(27) =20702328a(28) =37498589a(29) =67856074

External references