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

 

Logo

Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing.
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A115836 Self-describing sequence. The n-th integer of the sequence indicates how many integers of the sequence are strictly < 2n. 0

%I

%S 1,2,4,5,6,8,10,11,12,13,14,16,18,20,22,23,24,25,26,27,28,29,30,32,34,

%T 36,38,40,42,44,46,47,48,49,50,51,52,53,54,55,56,57,58,59,60,61,62,64,

%U 66,68,70,72,74,76,78,80,82,84,86,88,90,92,94,95,96,97,98,99,100,101

%N Self-describing sequence. The n-th integer of the sequence indicates how many integers of the sequence are strictly < 2n.

%C Terms computed by Gilles Sadowski. In building step by step the sequence one has sometimes the choice for an integer. If so take the smallest available one.

%D Hsien-Kuei Hwang, S Janson, TH Tsai, Exact and asymptotic solutions of the recurrence f(n) = f(floor(n/2)) + f(ceiling(n/2)) + g(n): theory and applications, Preprint, 2016; http://140.109.74.92/hk/wp-content/files/2016/12/aat-hhrr-1.pdf. Also Exact and Asymptotic Solutions of a Divide-and-Conquer Recurrence Dividing at Half: Theory and Applications, ACM Transactions on Algorithms, 13:4 (2017), #47; DOI: 10.1145/3127585

%F a(n) = A007378(n+1)-2 - _Benoit Cloitre_, May 22 2008

%e A(7)=10 because there are 10 integers in the sequence which are strictly < 14 (they are 1,2,4,5,6,8,10,11,12,13)

%Y Cf. A080653.

%K base,easy,nonn

%O 1,2

%A _Eric Angelini_, Feb 01 2006

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 13 09:54 EST 2019. Contains 329968 sequences. (Running on oeis4.)