a(n) is the number of distinct pairs that can be made in exactly n iterations of either of the two maps (x, y) -> (x OR (2^y), 0) or (x, y) -> (x, y+1), starting from (0,0).
A353150
a(n) is the number of distinct pairs that can be made in exactly n iterations of either of the two maps (x, y) -> (x OR (2^y), 0) or (x, y) -> (x, y+1), starting from (0,0).
Terms
- a(0) =1a(1) =2a(2) =4a(3) =7a(4) =12a(5) =18a(6) =28a(7) =40a(8) =58a(9) =80a(10) =110a(11) =147a(12) =198a(13) =259a(14) =338a(15) =434a(16) =558a(17) =706a(18) =892a(19) =1114a(20) =1389a(21) =1715a(22) =2115a(23) =2588a(24) =3163a(25) =3836a(26) =4647a(27) =5593a(28) =6725a(29) =8042
External references
- oeis: A353150