The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 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
 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, 36, 38, 40, 42, 44, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 64, 66, 68, 70, 72, 74, 76, 78, 80, 82, 84, 86, 88, 90, 92, 94, 95, 96, 97, 98, 99, 100, 101 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS 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. REFERENCES 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 LINKS FORMULA a(n) = A007378(n+1)-2 - Benoit Cloitre, May 22 2008 EXAMPLE 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) CROSSREFS Cf. A080653. Sequence in context: A169956 A035500 A080653 * A176554 A284895 A285354 Adjacent sequences:  A115833 A115834 A115835 * A115837 A115838 A115839 KEYWORD base,easy,nonn AUTHOR Eric Angelini, Feb 01 2006 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
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified January 25 08:01 EST 2021. Contains 340416 sequences. (Running on oeis4.)