Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A079905
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A079905 a(1)=1; then a(n) is smallest positive integer which is consistent with sequence being monotonically increasing and satisfying a(a(n)) = 2n+1 for n>1. +0
5
1, 3, 5, 6, 7, 9, 11, 12, 13, 14, 15, 17, 19, 21, 23, 24, 25, 26, 27, 28, 29, 30, 31, 33, 35, 37, 39, 41, 43, 45, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 65, 67, 69, 71, 73, 75, 77, 79, 81, 83, 85, 87, 89, 91, 93, 95, 96, 97, 98, 99, 100, 101, 102 (list; graph; listen)
OFFSET

1,2

COMMENT

Alternate definition: a(n) is taken to be smallest positive integer greater than a(n-1) such that the condition "a(a(n)) is always odd" can be satisfied. - Matthew Vandermast (ghodges14(AT)comcast.net), Mar 03 2003

Also: a(n)=smallest positive integer > a(n-1) such that the condition "n is in the sequence if and only if a(n) is even" is false; that is, the condition "either n is not in the sequence and a(n) is odd or n is in the sequence and a(n) is even" is satisfied. - Matthew Vandermast (ghodges14(AT)comcast.net), Mar 05 2003

LINKS

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(1)=1, a(2)=3, then a(3*2^k - 1 + j) = 4*2^k - 1 + 3j/2 + |j|/2 for k >= 1, -2^k <= j < 2^k.

a(n) = 1+A079945(n-1)-A079944(n-1) for n>1, a(1)=1. - Antonio G. Astudillo (afg_astudillo(AT)hotmail.com), Feb 23 2003

CROSSREFS

See A080637 for a nicer version. Cf. A079000.

Equals A007378(n+1)-1, n>1.

A007378, A079905, A080637, A080653 are all essentially the same sequence.

Sequence in context: A165712 A161373 A103826 this_sequence A154611 A164028 A047273

Adjacent sequences: A079902 A079903 A079904 this_sequence A079906 A079907 A079908

KEYWORD

nonn,easy

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com), Feb 21 2003

EXTENSIONS

More terms from Antonio G. Astudillo (afg_astudillo(AT)hotmail.com), Feb 23 2003

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 17 19:39 EST 2009. Contains 170821 sequences.


AT&T Labs Research