id:A139436 - OEIS Search Results

Search: id:A139436

Displaying 1-1 of 1 results found.

page 1

Number of ways to write n as sum of initial terms of a Collatz trajectory starting with a value less than n.

+0
3

0, 0, 1, 0, 1, 1, 3, 1, 2, 1, 1, 2, 2, 4, 3, 1, 1, 3, 3, 1, 7, 2, 1, 3, 1, 2, 2, 5, 4, 3, 4, 1, 4, 2, 7, 5, 3, 2, 3, 5, 1, 9, 5, 2, 6, 3, 3, 4, 8, 4, 5, 5, 4, 6, 5, 8, 5, 3, 5, 7, 5, 5, 11, 5, 3, 7, 6, 4, 7, 10, 6, 4, 7, 6, 6, 6, 11, 6, 4, 7, 6, 5, 5, 14, 6, 3, 7, 8, 4, 7, 16, 5, 6, 6, 7, 5, 5, 12, 8, 3, 7, 7 (list; graph; listen)

	OFFSET	`1,7`
	COMMENT	`a(n) = 0 iff A139435(n) = 0; a(n) > 0 for n > 4;` `a(A139437(n)) = 1.`
	LINKS	`R. Zumkeller, Table of n, a(n) for n = 1..10000` `Eric Weisstein's World of Mathematics, Collatz Problem` `Index entries for sequences related to 3x+1 (or Collatz) problem`
	EXAMPLE	`a(10) = #{2+1+4+2+1} = 1;` `a(11) = #{4+2+1+4} = 1;` `a(12) = #{1+4+2+1+4,8+4} = 2;` `a(13) = #{4+2+1+4+2,3+10} = 2;` `a(14) = #{1+4+2+1+4+2,2+1+4+2+1+4,4+2+1+4+2+1,8+4+2} = 4;` `a(15) = #{1+4+2+1+4+2+1,8+4+2+1,10+5} = 3.`
	CROSSREFS	`Cf. A006370.` `Sequence in context: A016569 A072801 A098872 this_sequence A084642 A010281 A080131` `Adjacent sequences: A139433 A139434 A139435 this_sequence A139437 A139438 A139439`
	KEYWORD	`nonn`
	AUTHOR	`Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Apr 21 2008`

page 1

Search completed in 0.002 seconds

Last modified July 25 07:41 EDT 2008. Contains 142293 sequences.

AT&T Labs Research