All about flooble | fun stuff | Get a free chatterbox | Free JavaScript | Avatars    
perplexus dot info

Home > Numbers
Recursive Definition (Posted on 2005-09-09) Difficulty: 4 of 5
Define H(m,n) for m≥n≥0 by

  • H(m,n)=1, if n≤1
  • H(m,n)=Σi=1..nH(m-i,minimum(i,m-i)), if n>1
  • For any integer k>0, what do you think H(k,k) represents?

    See The Solution Submitted by Bractals    
    No Rating

    Comments: ( Back to comment list | You must be logged in to post comments.)
    just a little resume to think later | Comment 4 of 7 |
     k  H(k,k)       
     2....2..........
     3....3..........
     4....5..........
     5....7..........
     6....11.........
     7....15.........
     8....22.........
     9....30.........
    10....42.........
    11....56.........
    12....77
    13....101
    14....135
    15....176
    16....231
    17....297
    18....385

      Posted by pcbouhid on 2005-09-09 15:56:09
    Please log in:
    Login:
    Password:
    Remember me:
    Sign up! | Forgot password


    Search:
    Search body:
    Forums (0)
    Newest Problems
    Random Problem
    FAQ | About This Site
    Site Statistics
    New Comments (0)
    Unsolved Problems
    Top Rated Problems
    This month's top
    Most Commented On

    Chatterbox:
    Copyright © 2002 - 2018 by Animus Pactum Consulting. All rights reserved. Privacy Information