id:A083927 - OEIS Search Results

Search: id:A083927

Displaying 1-1 of 1 results found.

page 1

Inverse function of N -> N injection A057123.

+0
17

0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 0, 0, 0, 3, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 4, 0, 0, 0, 0, 0, 0, 0, 5, 0 (list; graph; listen)

	OFFSET	`0,13`
	COMMENT	`a(0)=0 because A057123(0)=0, but a(n) = 0 also for those n which do not occur as values of A057123. All positive natural numbers occur here once.` `If g(n) = A083927(f(A057123(n))) then we can say that gatomorphism g embeds into gatomorphism f in scale n:2n, using the obvious binary tree -> general tree embedding. E.g. we have: A057163 = A083927(A057164(A057123(n))), A057117 = A083927(A072088(A057123(n))), A057118 = A083927(A072089(A057123(n))), A069770 = A083927(A072796(A057123(n))), A072797 = A083927(A072797(A057123(n))).`
	LINKS	`A. Karttunen, Gatomorphisms`
	PROGRAM	`(Scheme-function showing the essential idea. For the full source, follow the "gatomorphisms" link.)` `(define (Tree2BinTree_if_possible gt) (call-with-current-continuation (lambda (e) (let recurse ((gt gt)) (cond ((not (pair? gt)) gt) ((eq? 2 (length gt)) (cons (recurse (car gt)) (recurse (cadr gt)))) (else (e '())))))))`
	CROSSREFS	`a(A057123(n)) = n for all n. Cf. A083925-A083926, A083928-A083929, A083935.` `Sequence in context: A153587 A059286 A076998 this_sequence A154724 A134402 A132440` `Adjacent sequences: A083924 A083925 A083926 this_sequence A083928 A083929 A083930`
	KEYWORD	`nonn`
	AUTHOR	`Antti Karttunen (MyFirstname.MySurname(AT)iki.fi) May 13 2003`

page 1

Search completed in 0.002 seconds

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

AT&T Labs Research