login
This site is supported by donations to The OEIS Foundation.

 

Logo

Annual Appeal: Please make a donation (tax deductible in USA) to keep the OEIS running. Over 5000 articles have referenced us, often saying "we discovered this result with the help of the OEIS".

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
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, 13, 13, 13, 14, 14, 14, 14, 14, 14, 14, 14, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,2

COMMENTS

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

LINKS

R. Zumkeller, Table of n, a(n) for n = 0..10000

PROG

(PARI) a(n)=if(n<3, return(n+1)); a(n\2) + a(n\5) \\ Charles R Greathouse IV, Nov 14 2016

CROSSREFS

Cf. A007731, A083662, A088468, A165704.

Sequence in context: A241920 A202305 A195778 * A242453 A241151 A073092

Adjacent sequences:  A165703 A165704 A165705 * A165707 A165708 A165709

KEYWORD

nonn

AUTHOR

Reinhard Zumkeller, Sep 26 2009

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy .

Last modified December 9 21:41 EST 2016. Contains 278987 sequences.