

A132671


a(1)=1, a(n) = 7*a(n1) if the minimal positive integer not yet in the sequence is greater than a(n1), else a(n) = a(n1)  1.


0



1, 7, 6, 5, 4, 3, 2, 14, 13, 12, 11, 10, 9, 8, 56, 55, 54, 53, 52, 51, 50, 49, 48, 47, 46, 45, 44, 43, 42, 41, 40, 39, 38, 37, 36, 35, 34, 33, 32, 31, 30, 29, 28, 27, 26, 25, 24, 23, 22, 21, 20, 19, 18, 17, 16, 15, 105, 104, 103, 102, 101, 100, 99, 98, 97, 96, 95, 94, 93, 92
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

1,2


COMMENTS

Also: a(1)=1, a(n) = maximal positive integer < a(n1) not yet in the sequence, if it exists, else a(n) = 7*a(n1).
Also: a(1)=1, a(n) = a(n1)  1, if a(n1)  1 > 0 and has not been encountered so far, else a(n) = 7*a(n1).
A permutation of the positive integers. The sequence is selfinverse, in that a(a(n)) = n.


LINKS

Table of n, a(n) for n=1..70.


FORMULA

G.f.: g(x) = (x(12x)/(1x) + 7x^2*f'(x^(13/6)) + (13/49)*(f'(x^(1/6))  7x  1)/(1x) where f(x) = Sum_{k>=0} x^(7^k) and f'(z) = derivative of f(x) at x = z.
a(n) = (20*7^(r/2)  8)/6  n if both r and s are even, else a(n) = (62*7^((s1)/2)  8)/6  n, where r = ceiling(2*log_7((6n+7)/13)) and s = ceiling(2*log_7(6n+7)/6))  1.
a(n) = (7^floor(1 + (k+1)/2) + 13*7^floor(k/2)  8)/6  n, where k=r if r is odd, else k=s (with respect to r and s above; formally, k = ((r+s)  (rs)*(1)^r)/2).


CROSSREFS

For formulas concerning a general parameter p (with respect to the recurrence rule ... a(n) = p*a(n1) ...) see A132374.
For p=2 to p=10 see A132666 through A132674.
Sequence in context: A194755 A333884 A055118 * A074921 A182209 A120634
Adjacent sequences: A132668 A132669 A132670 * A132672 A132673 A132674


KEYWORD

nonn


AUTHOR

Hieronymus Fischer, Sep 15 2007


STATUS

approved



