86632
domain: N
Appears in sequences
- Consider recurrence b(0) = n/3, b(n) = b(n-1)*floor(b(n-1)); sequence gives first integer reached, or -1 if no integer is ever reached.at n=7A083863
- The first integer in the sequence defined by b(0)=(2n+1)/n and b(k+1)=b(k)*floor(b(k)) for k>=0.at n=5A087670
- Number of arrangements of n indistinguishable balls in n boxes with the maximum number of balls in any box equal to 9.at n=5A180289
- Number of arrangements of n indistinguishable balls in n boxes with the maximum number of balls in any box equal to n-5.at n=8A180295
- Combined weight, as defined at A244094, of the distinct-parts partitions of n.at n=35A234924
- Number of tied close American football games: number of ways for the game to end at the score of n to n and never be separated by more than one score after each play.at n=12A301381
- Numbers c such that there is a Pythagorean triple (a,b,c) such that (A001414(a), A001414(b), A001414(c)) is also a Pythagorean triple.at n=2A337540