

A080639


a(1) = 1; for n>1, a(n) is taken to be the smallest integer greater than a(n1) which is consistent with the condition "for n>1, n is a member of the sequence if and only if a(n) is even".


5



1, 2, 5, 7, 8, 9, 10, 12, 14, 16, 17, 18, 19, 20, 21, 22, 24, 26, 28, 30, 32, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 48, 50, 52, 54, 56, 58, 60, 62, 64, 66, 68, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 96
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

1,2


REFERENCES

HsienKuei 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/wpcontent/files/2016/12/aathhrr1.pdf. Also Exact and Asymptotic Solutions of a DivideandConquer 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..71.
B. Cloitre, N. J. A. Sloane and M. J. Vandermast, Numerical analogues of Aronson's sequence, J. Integer Seqs., Vol. 6 (2003), #03.2.2.
B. Cloitre, N. J. A. Sloane and M. J. Vandermast, Numerical analogues of Aronson's sequence (math.NT/0305308)
Index entries for sequences of the a(a(n)) = 2n family


FORMULA

{a(a(n))} = {1, 2, 2i, i >= 4}.


CROSSREFS

Cf. A079253, A079000.
Sequence in context: A186277 A061770 A210449 * A186306 A047483 A167408
Adjacent sequences: A080636 A080637 A080638 * A080640 A080641 A080642


KEYWORD

nonn,easy


AUTHOR

N. J. A. Sloane and Benoit Cloitre, Feb 28 2003


EXTENSIONS

More terms from Matthew Vandermast, Feb 28 2003


STATUS

approved



