Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A080596
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
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. +0
3
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; listen)
OFFSET

1,2

LINKS

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 this_sequence A032492 A050560 A035243

Adjacent sequences: A080593 A080594 A080595 this_sequence A080597 A080598 A080599

KEYWORD

easy,nonn

AUTHOR

N. J. A. Sloane (njas(AT)research.att.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 November 23 10:40 EST 2009. Contains 167421 sequences.


AT&T Labs Research