Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #4 Mar 31 2012 13:21:17
%S 0,2,4,5,6,9,10,11,12,13,14,15,16,19,23,24,25,26,27,28,29,30,31,32,33,
%T 34,35,36,37,38,39,40,41,42,43,44,47,51,52,53,56,60,65,66,67,68,69,70,
%U 71,72,73,74,75,76,77,78,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93
%N Positions of general trees in A014486 whose degree is not one.
%H A. Karttunen, <a href="/A153242/b153242.txt">Table of n, a(n) for n = 0..1000</a>
%Y I.e. such i that A057515(i) is not 1. Complement of A057548. For n>0, gives the indices of trees whose degree is greater than one. (At least two top-level branches).
%K nonn
%O 0,2
%A _Antti Karttunen_, Dec 21 2008