

A127366


Let m = floor(sqrt(n)); if n and m have the same parity, a(n) = n + m, otherwise a(n) = n  m.


4



0, 2, 1, 4, 6, 3, 8, 5, 10, 12, 7, 14, 9, 16, 11, 18, 20, 13, 22, 15, 24, 17, 26, 19, 28, 30, 21, 32, 23, 34, 25, 36, 27, 38, 29, 40, 42, 31, 44, 33, 46, 35, 48, 37, 50, 39, 52, 41, 54, 56, 43, 58, 45, 60, 47, 62, 49, 64, 51, 66, 53, 68, 55, 70, 72, 57, 74, 59, 76, 61, 78, 63, 80
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

0,2


COMMENTS

This is a permutation of the nonnegative integers; it can also be generated by the rule (with m = floor(sqrt(n))): if n  m is not yet in the sequence, a(n) = n  m, otherwise a(n) = n + m. All cycles in this permutation are finite. There is one relatively large cycle starting at n = 4k^2  2k + 1 for each k and k 2cycles for n = (2k  1)^2 + 2i and (2k  1)^2 + 2k  1 + 2i with 0 <= i < k.


LINKS



MATHEMATICA

a[n_] := If[m = Floor[Sqrt[n]]; OddQ[n] && OddQ[m]  EvenQ[n] && EvenQ[m], n+m, nm]; Table[ a[n], {n, 0, 72}](* JeanFrançois Alcover, Nov 30 2011 *)


PROG

(Haskell)
a127366 n  even n' = n'
 otherwise = 2*n  n'
where n' = n + a000196 n


CROSSREFS



KEYWORD

nice,nonn


AUTHOR



STATUS

approved



