|
|
A127752
|
|
Row sums of inverse of number triangle A(n,k) = 1/(3n+1) if k <= n <= 2k, 0 otherwise.
|
|
3
|
|
|
1, 4, 3, 7, 3, 6, 3, 10, 3, 6, 3, 9, 3, 6, 3, 13, 3, 6, 3, 9, 3, 6, 3, 12, 3, 6, 3, 9, 3, 6, 3, 16, 3, 6, 3, 9, 3, 6, 3, 12, 3, 6, 3, 9, 3, 6, 3, 15, 3, 6, 3, 9, 3, 6, 3, 12, 3, 6, 3, 9, 3, 6, 3, 19, 3, 6, 3, 9, 3, 6, 3, 12, 3, 6, 3, 9, 3, 6, 3, 15, 3, 6, 3, 9, 3, 6, 3, 12, 3, 6, 3, 9, 3, 6, 3, 18, 3, 6, 3, 9, 3, 6, 3, 12, 3, 6
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,2
|
|
COMMENTS
|
Row sums of number triangle A127751.
a(n) mod 2 is first Feigenbaum symbolic sequence A035263 (conjecture).
The conjecture is true at least up to 2048 first terms. (But please note the different indexing, here 0-based.) - Antti Karttunen, Sep 29 2018
|
|
LINKS
|
|
|
MATHEMATICA
|
A[n_, k_] := If[k <= n <= 2k, 1/(3n+1), 0];
|
|
PROG
|
(PARI)
up_to = 128;
A127752aux(n, k) = if(k<=n, if(n<=(2*k), 1/((3*n)+1), 0), 0);
A127752list(up_to) = { my(m1=matrix(up_to, up_to, n, k, A127752aux(n-1, k-1)), m2 = matsolve(m1, matid(up_to)), v = vector(up_to)); for(n=1, up_to, v[n] = vecsum(m2[n, ])); (v); };
v127752 = A127752list(1+up_to);
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|