

A060030


If the numbers a(1)...a(n) contain a hole, then a(n+1) is the largest hole; otherwise a(n+1) = a(n1) + a(n).


3



1, 2, 3, 5, 4, 9, 8, 7, 6, 13, 12, 11, 10, 21, 20, 19, 18, 17, 16, 15, 14, 29, 28, 27, 26, 25, 24, 23, 22, 45, 44, 43, 42, 41, 40, 39, 38, 37, 36, 35, 34, 33, 32, 31, 30, 61, 60, 59, 58, 57, 56, 55, 54, 53, 52, 51, 50, 49, 48, 47, 46, 93, 92, 91, 90, 89, 88, 87, 86, 85, 84, 83
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

1,2


COMMENTS

A selfinverse permutation of the natural numbers: a(a(n)) = n and a(n) <> n for n > 3. [Reinhard Zumkeller, Apr 29 2012]


LINKS



PROG

(Haskell)
import Data.List (delete)
a060030 n = a060030_list !! (n1)
a060030_list = 1 : 2 : f 1 2 [3..] where
f u v ws = y : f v y (delete y ws) where
y = if null xs then u + v else last xs
xs = takeWhile (< v) ws


CROSSREFS

See A060482 for successive records, A027383 for the final holefilling values, A016116 for the difference between top and bottom of downward subsequences, A052551 for number of terms in downward subsequences.


KEYWORD

easy,nice,nonn


AUTHOR

William Nelles (wnelles(AT)flashmail.com), Mar 17 2001


EXTENSIONS



STATUS

approved



