a(n) is the action of recursively applying 'Rule 30' elementary cellular automata on the binary representation of n if the cells may only expand into the significant bit, a(0) = 1.

A074890

a(n) is the action of recursively applying 'Rule 30' elementary cellular automata on the binary representation of n if the cells may only expand into the significant bit, a(0) = 1.

Terms

    a(0) =1a(1) =3a(2) =6a(3) =13a(4) =25a(5) =55a(6) =100a(7) =222a(8) =401a(9) =891a(10) =1602a(11) =3559a(12) =6428a(13) =14258a(14) =25647a(15) =56936a(16) =102860a(17) =228154a(18) =410339a(19) =910998a(20) =1645813a(21) =3650437a(22) =6565453a(23) =14576121a(24) =26332935a(25) =58407052a(26) =105047514a(27) =233217299a(28) =421327294a(29) =934513441

External references