id:A116623 - OEIS Search Results

Search: id:A116623

Displaying 1-1 of 1 results found.

page 1

a(0)=1, a(2n) = a(n)+A000079(A000523(2n)), a(2n+1) = 3*a(n) + A000079(A000523(2n+1)+1).

+0
3

1, 5, 7, 19, 11, 29, 23, 65, 19, 49, 37, 103, 31, 85, 73, 211, 35, 89, 65, 179, 53, 143, 119, 341, 47, 125, 101, 287, 89, 251, 227, 665, 67, 169, 121, 331, 97, 259, 211, 601, 85, 223, 175, 493, 151, 421, 373, 1087, 79, 205, 157, 439, 133, 367, 319, 925, 121 (list; graph; listen)

	OFFSET	`0,2`
	COMMENT	`Viewed as a binary tree, this is (1); 5; 7,19; 11,29,23,65; ... Related to the parity vectors of Collatz and Terras trajectories.`
	LINKS	`Index entries for sequences related to 3x+1 (or Collatz) problem`
	PROGRAM	`(MIT Scheme:)` `(define (A116623 n) (cond ((zero? n) 1) ((even? n) (+ (A116623 (/ n 2)) (expt 2 (A000523 n)))) (else (+ (* 3 (A116623 (/ (- n 1) 2))) (expt 2 (+ 1 (A000523 n)))))))`
	CROSSREFS	`Cf. a(n) = A116640(A059893(n)). a(A000225(n)) = A001047(n+1). For n>= 1 a(A000079(n)) = A062709(n+1). A116641 gives the terms in ascending order and without duplicates.` `Sequence in context: A138919 A028319 A116640 this_sequence A046151 A046078 A075409` `Adjacent sequences: A116620 A116621 A116622 this_sequence A116624 A116625 A116626`
	KEYWORD	`nonn,tabf`
	AUTHOR	`Antti Karttunen (His-Firstname.His-Surname(AT)gmail.com), Feb 20 2006. Proposed by Pierre Lamothe (plamothe(AT)aei.ca), May 21 2004.`

page 1

Search completed in 0.002 seconds

Last modified November 18 20:14 EST 2008. Contains 147244 sequences.

AT&T Labs Research