|
|
A006209
|
|
Generalized Fibonacci numbers A_{n,4}.
(Formerly M0027)
|
|
7
|
|
|
1, 1, 0, 1, 0, 2, 0, 3, 1, 6, 2, 9, 4, 18, 8, 30, 16, 56, 32, 101, 64, 191, 128, 351, 256, 668, 512, 1257, 1026, 2402, 2056, 4592, 4122, 8854, 8272, 17092, 16608, 33212, 33364, 64674, 67072, 126490, 134912, 248038, 271528, 487986, 546818, 962350
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,6
|
|
REFERENCES
|
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
|
|
LINKS
|
|
|
MATHEMATICA
|
max = 100; Clear[b1, b2];
For[n = 1, n <= max, n++,
For[j = 1, j <= n, j++, b1[1][j, n] = 0; b1[2][j, n] = 1; b2[1][j, n] = b2[2][j, n] = 0];
b2[1][n, n] = b2[2][n, n] = 1];
For[k = 3, k <= max, k++,
For[n = 1, n <= max, n++,
For[j = 1, j <= n-1, j++, b1[k][j, n] = b1[k-2][1, n] + b1[k-2][j+1, n]; b2[k][j, n] = b2[k-2][1, n] + b2[k-2][j+1, n]];
b1[k][n, n] = b1[k-2][1, n] + b1[k-1][n, n]; b2[k][n, n] = b2[k-2][1, n] + b2[k-1][n, n]
]];
phin[n_] := Table[b2[m][n, n] + 2 Sum[If[m + 2 - 2 j > 0, b1[m + 2 - 2j][j, n], 0], {j, 1, n}], {m, 1, max}];
MT[s_List] := Table[DivisorSum[n, MoebiusMu[#] s[[n/#]]&]/n, {n, 1, Length[s]}];
|
|
PROG
|
(PARI) \\ implementation of MT() and phin() is given in A006207
|
|
CROSSREFS
|
Cf. A006206 (A_{n,1}), A006207 (A_{n,2}), A006208 (A_{n,3}), A130628 (A_{n,5}), A208092 (A_{n,6}), A006210 (D_{n,2}), A006211 (D_{n,3}), A094392.
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|