id:A160001 - OEIS Search Results

Search: id:A160001

Displaying 1-1 of 1 results found.

page 1

Number of partitions of n into distinct parts occurring in '3x+1'-trajectory starting with n.

+0
2

1, 1, 2, 1, 2, 4, 3, 1, 4, 3, 4, 9, 4, 8, 5, 1, 6, 18, 10, 5, 2, 13, 6, 25, 19, 10, 8, 41, 24, 14, 10, 1, 40, 19, 8, 138, 90, 55, 62, 7, 17, 3, 144, 63, 34, 16, 16, 43, 218, 148, 105, 22, 7, 39, 24, 323, 371, 150, 224, 54, 27, 40, 30, 1, 572, 444, 344, 71, 32, 19, 39, 1766, 52 (list; graph; listen)

	OFFSET	`1,3`
	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, 4+2+1} = 3.`
	CROSSREFS	`Cf. A160000, A000009, A159999, A006370.` `Sequence in context: A079878 A137406 A120855 this_sequence A091173 A101897 A078142` `Adjacent sequences: A159998 A159999 A160000 this_sequence A160002 A160003 A160004`
	KEYWORD	`nonn`
	AUTHOR	`Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), May 11 2009`

page 1

Search completed in 0.002 seconds

Last modified December 20 00:58 EST 2009. Contains 171054 sequences.

AT&T Labs Research