login
The OEIS is supported bythe many generous donors to the OEIS Foundation.


Hints
(Greetings fromThe On-Line Encyclopedia of Integer Sequences!)
A194683 Triangular array: T(n,k)=[<r^n>+<r^k>], where [ ] = floor, < > = fractional part, and r=(1+sqrt(3))/2. 5
0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0
(list; table; graph; refs; listen; history; text; internal format)
OFFSET
1
COMMENTS
n-th row sum gives number of k in [0,1] for which <r^n>+<r^k> > 1; seeA194684.
LINKS
EXAMPLE
First ten rows:
0
1 1
0 1 1
0 1 1 0
1 1 1 1 1
0 1 1 0 1 0
1 1 1 1 1 1 1
0 0 0 0 0 0 1 0
0 1 1 1 1 1 1 0 1
0 1 1 1 1 1 1 0 1 1
MATHEMATICA
r = 1/2 + Sqrt[3]/2; z = 15;
p[x_]:= FractionalPart[x]; f[x_]:= Floor[x];
w[n_, k_]:= p[r^n] + p[r^k] - p[r^n + r^k]
Flatten[Table[w[n, k], {n, 1, z}, {k, 1, n}]]
TableForm[Table[w[n, k], {n, 1, z}, {k, 1, n}]]
s[n_]:= Sum[w[n, k], {k, 1, n}]
Table[s[n], {n, 1, 100}] (*A194684*)
h[n_, k_]:= f[p[n*r] + p[k*r]]
Flatten[Table[h[n, k], {n, 1, z}, {k, 1, n}]]
TableForm[Table[h[n, k], {n, 1, z}, {k, 1, n}]]
t[n_]:= Sum[h[n, k], {k, 1, n}]
Table[t[n], {n, 1, 100}] (*A194686*)
CROSSREFS
KEYWORD
nonn,tabl
AUTHOR
Clark Kimberling,Sep 01 2011
STATUS
approved

Lookup| Welcome| Wiki| Register| Music| Plot 2| Demos| Index| Browse| WebCam
Contribute new seq. or comment| Format| Style Sheet| Transforms| Superseeker| Recents
The OEIS Community| Maintained byThe OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 18 16:24 EDT 2024. Contains 376000 sequences. (Running on oeis4.)