|
|
A100463
|
|
a(n) = 2^(n-1) - A100462(n).
|
|
2
|
|
|
0, 1, 3, 5, 9, 7, 15, 19, 27, 31, 21, 29, 45, 49, 75, 85, 97, 65, 63, 101, 153, 125, 157, 127, 177, 163, 165, 199, 229, 199, 217, 277, 253, 325, 315, 365, 345, 379, 423, 449, 549, 529, 597, 409, 507, 473, 633, 569, 717, 523, 651, 655, 777, 793, 825, 835, 855, 833
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,3
|
|
LINKS
|
|
|
MAPLE
|
A100461:= proc(m, n) option remember;
if m=1 then 2^(n-1);
else (n-m+1)*floor((A100461(m-1, n)-1)/(n-m+1));
fi; end:
|
|
MATHEMATICA
|
t[n_, k_]:= t[n, k]= If[k==1, 2^(n-1), If[k<n+1, (n-k+1)*Floor[(t[n, k -1] -1)/(n-k+1)], 0]]; (* t = A100461 *)
Table[2^(n-1) -t[n, n], {n, 60}] (* G. C. Greubel, Apr 07 2023 *)
|
|
PROG
|
(Magma)
if k eq 1 then return 2^(n-1);
else return (n-k+1)*Floor((t(n, k-1) -1)/(n-k+1));
end if;
end function;
(SageMath)
if (k==1): return 2^(n-1)
else: return (n-k+1)*((t(n, k-1) -1)//(n-k+1))
[2^(n-1) - t(n, n) for n in range(1, 61)] # G. C. Greubel, Apr 07 2023
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|