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 #11 Aug 18 2024 10:39:08
%S 5,6,7,8,9,10,12,14,16,19,22,26,31,37,44,52,62,74,88,105,126,151,181,
%T 217,260,312,374,448,537,644,772,926,1111,1333,1599,1918,2301,2761,
%U 3313,3975,4770,5724,6868,8241,9889,11866,14239,17086,20503,24603,29523,35427,42512
%N a(n+1) = a(n) + floor(a(n)/5) with a(0)=5.
%H Robert Israel, <a href="/A182306/b182306.txt">Table of n, a(n) for n = 0..10000</a>
%p f:= proc(n) option remember; procname(n-1) + floor(procname(n-1)/5)
%p end proc:
%p f(0):= 5:
%p map(f, [$0..100]); # _Robert Israel_, Mar 12 2018
%t NestList[#+Floor[#/5]&,5,60] (* _Harvey P. Dale_, Aug 18 2024 *)
%o (Python)
%o a=5
%o for i in range(55):
%o . print a,
%o . a += a/5
%Y Cf. A061418, A100585, A182305.
%K nonn
%O 0,1
%A _Alex Ratushnyak_, Apr 23 2012