id:A083928 - OEIS Search Results

Search: id:A083928

Displaying 1-1 of 1 results found.

page 1

Inverse function of N -> N injection A080298.

+0
4

0, 0, 0, 0, 0, 0, 1, 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, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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 (list; graph; listen)

	OFFSET	`0,40`
	COMMENT	`a(1)=0 because A080298(0)=1, but a(n) = 0 also for those n which do not occur as values of A080298. All positive natural numbers occur here once.` `For example, A057163 = A083928(A057163(A080298(n))), i.e. gatomorphism A057163 embeds into itself in scale n:2n+1 using the obvious zigzag-tree -> binary tree embedding.`
	LINKS	`A. Karttunen, Gatomorphisms`
	PROGRAM	`(Scheme-function showing the essential idea. For the full source, follow the "gatomorphisms" link.)` `(define (ZigzagTree2BinTree_if_possible gt) (call-with-current-continuation (lambda (e) (let recurse ((gt gt)) (cond ((equal? gt '(() . ())) (list)) ((not (pair? gt)) (e '())) (else (cons (recurse (car gt)) (recurse (cdr gt)))))))))`
	CROSSREFS	`a(A080298(n)) = n for all n. Cf. A083925-A083927, A083929, A083935.` `Adjacent sequences: A083925 A083926 A083927 this_sequence A083929 A083930 A083931` `Sequence in context: A089803 A089811 A091888 this_sequence A074038 A071164 A027345`
	KEYWORD	`nonn`
	AUTHOR	`Antti Karttunen (MyFirstname.MySurname(AT)iki.fi) May 13 2003`

page 1

Search completed in 0.002 seconds

Last modified October 13 09:05 EDT 2008. Contains 145008 sequences.

AT&T Labs Research