# Greetings from The On-Line Encyclopedia of Integer Sequences! http://oeis.org/

Search: id:a080978
Showing 1-1 of 1

%I A080978 #14 Jan 11 2024 09:40:08
%S A080978 1,3,7,11,19,23,31,39,55,59,67,75,91,99,115,131,163,167,175,183,199,
%T A080978 207,223,239,271,279,295,311,343,359,391,423,487,491,499,507,523,531,
%U A080978 547,563,595,603,619,635,667,683,715,747,811,819,835,851,883,899,931,963
%N A080978 a(n) = 2*A006046(n) + 1.
%C A080978 The number of edges in A080973-trees.
%C A080978 Conjectured partial sums of A131136. - _Sean A. Irvine_, Jun 25 2022
%H A080978 Michael De Vlieger, <a href="/A080978/b080978.txt">Table of n, a(n) for n = 0..10000</a>
%H A080978 Hsien-Kuei Hwang, Svante Janson, and Tsung-Hsi Tsai, <a href="https://arxiv.org/abs/2210.10968">Identities and periodic oscillations of divide-and-conquer recurrences splitting at half</a>, arXiv:2210.10968 [cs.DS], 2022, pp. 6, 30.
%t A080978 Map[2 # + 1 &, {0}~Join~Accumulate@ Map[Count[#, _?OddQ] &, Table[Binomial[n, k], {n, 0, 54}, {k, 0, n}]]] (* _Michael De Vlieger_, Oct 30 2022 *)
%Y A080978 Cf. A006046, A080973.
%K A080978 nonn
%O A080978 0,2
%A A080978 _Antti Karttunen_, Mar 02 2003

# Content is available under The OEIS End-User License Agreement: http://oeis.org/LICENSE