login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A165706 a(0) = 1, a(n) = a([n/2]) + a([n/5]) for n > 1. 7

%I #5 Nov 14 2016 22:19:35

%S 1,2,3,3,4,5,5,5,6,6,8,8,8,8,8,8,9,9,9,9,12,12,12,12,12,13,13,13,13,

%T 13,13,13,14,14,14,14,14,14,14,14,18,18,18,18,18,18,18,18,18,18,21,21,

%U 21,21,21,21,21,21,21,21,21,21,21,21,22,22,22,22,22,22,22,22,22,22,22,22

%N a(0) = 1, a(n) = a([n/2]) + a([n/5]) for n > 1.

%C For n>0: A165707(n)=a(A003592(n)) and A165707(m)<a(m) for m < A003592(n).

%H R. Zumkeller, <a href="/A165706/b165706.txt">Table of n, a(n) for n = 0..10000</a>

%o (PARI) a(n)=if(n<3, return(n+1)); a(n\2) + a(n\5) \\ _Charles R Greathouse IV_, Nov 14 2016

%Y Cf. A007731, A083662, A088468, A165704.

%K nonn

%O 0,2

%A _Reinhard Zumkeller_, Sep 26 2009

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 06:49 EDT 2024. Contains 371964 sequences. (Running on oeis4.)