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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A080596 a(1)=1; for n >= 2, a(n) is smallest positive integer which is consistent with sequence being monotonically increasing and satisfying a(a(n)) = 2n+3. 2
1, 4, 5, 7, 9, 10, 11, 12, 13, 15, 17, 19, 21, 22, 23, 24, 25, 26, 27, 28, 29, 31, 33, 35, 37, 39, 41, 43, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 63, 65, 67, 69, 71, 73, 75, 77, 79, 81, 83, 85, 87, 89, 91, 93, 94, 95, 96, 97, 98, 99, 100, 101, 102 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

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

Table of n, a(n) for n=1..70.

Index entries for sequences of the a(a(n)) = 2n family

FORMULA

a(1) = 1; then a(6*2^k-3+j) = 8*2^k-3+3j/2+|j|/2 for k >= 0, -2^(k+1) <= j < 2^(k+1).

CROSSREFS

Cf. A079000. Apart from initial terms, same as A079945.

Sequence in context: A011336 A094328 A081095 * A183866 A196004 A185600

Adjacent sequences:  A080593 A080594 A080595 * A080597 A080598 A080599

KEYWORD

easy,nonn

AUTHOR

N. J. A. Sloane, Feb 23 2003

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 19 15:24 EDT 2019. Contains 327198 sequences. (Running on oeis4.)