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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A210770 a(1) = 1, a(2) = 2; for n > 1, a(2*n+2) = smallest number not yet seen, a(2*n-1) = a(2*n) + a(2*n+2). 5
1, 2, 5, 3, 7, 4, 10, 6, 14, 8, 17, 9, 20, 11, 23, 12, 25, 13, 28, 15, 31, 16, 34, 18, 37, 19, 40, 21, 43, 22, 46, 24, 50, 26, 53, 27, 56, 29, 59, 30, 62, 32, 65, 33, 68, 35, 71, 36, 74, 38, 77, 39, 80, 41, 83, 42, 86, 44, 89, 45, 92, 47, 95, 48, 97, 49, 100 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

COMMENTS

Permutation of natural numbers with inverse A210771.

LINKS

Reinhard Zumkeller, Table of n, a(n) for n = 1..10000

Index entries for sequences that are permutations of the natural numbers

FORMULA

a(2*n-1) = A022441(n-1); a(2*n) = A055562(n-1).

PROG

(Haskell)

import Data.List (delete)

a210770 n = a210770_list !! (n-1)

a210770_list = 1 : 2 : f 1 2 [3..] where

   f u v (w:ws) = u' : w : f u' w (delete u' ws) where u' = v + w

CROSSREFS

Cf. A064736.

Sequence in context: A333811 A257906 A257983 * A227688 A328827 A181184

Adjacent sequences:  A210767 A210768 A210769 * A210771 A210772 A210773

KEYWORD

nonn

AUTHOR

Reinhard Zumkeller, Mar 25 2012

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 July 10 23:30 EDT 2020. Contains 335600 sequences. (Running on oeis4.)