|
Search: id:A160000
|
|
|
| A160000 |
|
Number of partitions of n into parts occurring in '3x+1'-trajectory starting with n. |
|
+0
2
|
|
| 1, 2, 3, 4, 5, 11, 9, 10, 17, 20, 23, 66, 35, 57, 51, 36, 77, 153, 122, 126, 61, 213, 189, 883, 353, 338, 337, 851, 645, 570, 571, 202, 1220, 1066, 901, 4017, 3462, 2440, 2777, 1598, 1852, 512, 8084, 4909, 3952, 3122, 3399, 29851, 17813, 11391, 11285, 7128
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
LINKS
|
R. Zumkeller, Table of n, a(n) for n = 1..100
Wikipedia, Collatz conjecture
Index entries for sequences related to 3x+1 (or Collatz) problem
|
|
EXAMPLE
|
7-22-11-34-17-52-26-13-40-20-10-5-16-8-[4-2-1]*:
{1,2,4,5,7} is the set of numbers <= n, occurring in this trajectory, therefore a(7) = #{7, 5+2, 5+1+1, 4+2+1, 4+1+1+1, 2+2+2+1, 2+2+1+1+1, 2+1+1+1+1+1, 1+1+1+1+1+1+1} = 9.
|
|
CROSSREFS
|
A160001, A000041, A159999, A006370.
Sequence in context: A111665 A111666 A080475 this_sequence A115306 A084545 A069908
Adjacent sequences: A159997 A159998 A159999 this_sequence A160001 A160002 A160003
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), May 11 2009
|
|
|
Search completed in 0.002 seconds
|
