login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A257512 Those vertices of the binary beanstalk whose children are both leaves. 5
10, 18, 25, 34, 41, 54, 56, 66, 73, 86, 88, 102, 110, 117, 119, 130, 137, 150, 152, 166, 174, 181, 183, 198, 206, 213, 222, 229, 243, 244, 246, 258, 265, 278, 280, 294, 302, 309, 311, 326, 334, 341, 350, 357, 371, 372, 374, 390, 398, 405, 414, 421, 435, 436, 446, 453, 467, 468, 483, 491, 498, 499, 501, 514 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

COMMENTS

Numbers n for which both A079559(A213723(n)) and A079559(A213724(n)) are zero.

Numbers which occur twice in A257507.

LINKS

Antti Karttunen, Table of n, a(n) for n = 1..16384

Paul Tek, Illustration of how natural numbers in range 0 .. 133 are organized as a binary tree in the binary beanstalk

EXAMPLE

10 is present, because A011371(12) = A011371(13) = 10, and both 12 and 13 are terms of A055938. See also Paul Tek's illustration.

PROG

(Scheme, with Antti Karttunen's IntSeq-library)

(define A257512 (MATCHING-POS 1 0 (lambda (n) (and (zero? (A079559 (A213723 n))) (zero? (A079559 (A213724 n)))))))

CROSSREFS

Cf. A011371, A055938, A079559, A213723, A213724, A257507, A257265.

First differences: A256490.

Subsequence of A005187, A213717 and A257508.

Sequence in context: A213717 A245578 A165250 * A125689 A244573 A230356

Adjacent sequences:  A257509 A257510 A257511 * A257513 A257514 A257515

KEYWORD

nonn

AUTHOR

Antti Karttunen, May 03 2015

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified November 12 22:01 EST 2018. Contains 317116 sequences. (Running on oeis4.)