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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A262903 Numbers that are not leaves but all of whose children are leaves in the tree generated by edge-relation A049820(child) = parent. 5
4, 5, 14, 16, 32, 41, 44, 77, 80, 92, 101, 110, 119, 128, 139, 148, 158, 161, 169, 176, 191, 192, 199, 215, 224, 227, 234, 238, 249, 262, 264, 277, 296, 311, 317, 327, 350, 351, 352, 360, 363, 382, 385, 389, 392, 395, 396, 411, 427, 430, 437, 448, 449, 461, 464, 483, 488, 518, 523, 531, 532, 542, 552, 561, 568, 570, 577, 579, 600, 601, 613, 619, 632, 634, 636, 645, 648, 659, 665, 666, 671, 682, 683, 696, 705, 723 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

COMMENTS

Numbers n for which A060990(n) > 0 and A060990(n) = A262900(n).

Numbers n for which A262695(n) = 2.

LINKS

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

PROG

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

(define A262903 (MATCHING-POS 1 0 (lambda (n) (and (not (zero? (A060990 n))) (= (A060990 n) (A262900 n))))))

(define A262903 (MATCHING-POS 1 0 (lambda (n) (= 2 (A262695 n)))))

CROSSREFS

Cf. A000005, A049820, A060990, A262695, A262900.

Subsequence of A262901 and A236562.

No common terms with A259934.

Cf. also A257512.

Sequence in context: A000867 A191142 A049770 * A079362 A222364 A222372

Adjacent sequences:  A262900 A262901 A262902 * A262904 A262905 A262906

KEYWORD

nonn

AUTHOR

Antti Karttunen, Oct 06 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 October 22 01:42 EDT 2018. Contains 316431 sequences. (Running on oeis4.)