Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #14 Dec 17 2022 06:35:23
%S 1,9,10,81,91,90,109,729,820,819,991,810,991,981,1180,6561,7399,7380,
%T 8929,7371,9010,8919,10729,7290,9091,8919,10720,8829,10801,10620,
%U 12781,59049,66790,66591,80551,66420,81199,80361,96670,66339,82639,81090
%N a(2*n+1) = 9*a(n), a(2*n+2) = 10*a(n) + a(n-1).
%H G. C. Greubel, <a href="/A116555/b116555.txt">Table of n, a(n) for n = 0..2500</a>
%F From _G. C. Greubel_, Oct 30 2016: (Start)
%F a(2*n+1) = 9*a(n).
%F a(2*n+2) = 10*a(n) + a(n-1). (End)
%t b[0] := 0; b[1] := 1;
%t b[n_?EvenQ] := b[n] = 9*b[n/2];
%t b[n_?OddQ] := b[n] = 10*b[(n - 1)/2] + b[(n - 3)/2];
%t Table[b[n], {n, 1, 70}]
%Y Cf. A116528, A116529, A116552, A116553, A116554.
%K nonn,easy
%O 0,2
%A _Roger L. Bagula_, Mar 15 2006
%E New name using formula, _Joerg Arndt_, Dec 17 2022