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 #6 Aug 03 2014 14:27:17
%S 1,3,9,28,88,276,867,2724,8558,26886,84465,265355,833637,2618948,
%T 8227668,25847981,81203827,255109346,801449647,2517828323,7909990963,
%U 24849969499,78068481620,245259368334,770505029782,2420612941117
%N a(n) = integer nearest Pi*a(n-1), where a(0) = 1.
%H Clark Kimberling, <a href="/A095716/b095716.txt">Table of n, a(n) for n = 0..250</a>
%t a[0] = 1; a[n_] := Round[Pi*a[n - 1]]; Table[a[n], {n, 0, 30}] (* _Clark Kimberling_, Aug 18 2012 *)
%Y Cf. A024581.
%K nonn
%O 0,2
%A Herman Jamke (hermanjamke(AT)fastmail.fm), Jul 07 2004