|
Search: id:A023531
|
|
|
| A023531 |
|
a(n) = 1 if n of form m(m+3)/2, otherwise 0. |
|
+0
56
|
|
| 1, 0, 1, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0
(list; table; graph; listen)
|
|
|
OFFSET
|
0,1
|
|
|
COMMENT
|
Can read as table: a(n,m)= 1 if n=m >= 0, else 0 (unit matrix).
a(n) = number of 1's between successive 0's (see also A005614, A003589 and A007538) - Eric Angelini (eric.angelini(AT)kntv.be), Jul 06 2005
|
|
LINKS
|
W. Lang, On generalizations of Stirling number triangles, J. Integer Seqs., Vol. 3 (2000), #00.2.4.
|
|
FORMULA
|
If (floor(sqrt(2*n))-(2*n/(floor(sqrt(2*n)))) = -1, 1, 0). - Gerald Hillier, Sep 11 2005
a(n)=1 - A023532(n); a(n)=1 - mod(floor(((10^(n+2) - 10)/9)10^(n+1 - binomial(floor((1+sqrt(9+8n))/2), 2) - (1+floor(log((10^(n+2) - 10)/9, 10))))), 10) - Paul Barry (pbarry(AT)wit.ie), May 25 2004
a(n)=floor((sqrt(9+8n)-1)/2)-floor((sqrt(1+8n)-1)/2). - Paul Barry (pbarry(AT)wit.ie), May 25 2004
a(n)=round(sqrt(2n+3))-round(sqrt(2n+2)). - Hieronymus Fischer (Hieronymus.Fischer(AT)gmx.de), Aug 06 2007
a(n)=ceiling(2*sqrt(2n+3))-floor(2*sqrt(2n+2))-1. - Hieronymus Fischer (Hieronymus.Fischer(AT)gmx.de), Aug 06 2007
a(n)=Sum_{k=1..oo}{C((n+2^(2*k)-k^2/2-k/2-1)^(2*k),n+2^(2*k)-k^2/2-k/2+1) mod 2} - Paolo P. Lava (ppl(AT)spl.at), Sep 07 2007
|
|
EXAMPLE
|
As a triangle:
.....1
....0.1
...0.0.1
..0.0.0.1
.0.0.0.0.1
0.0.0.0.0.1
|
|
CROSSREFS
|
Cf. A000217, A010054.
Sequence in context: A074381 A128407 A134286 this_sequence A089495 A114482 A127829
Adjacent sequences: A023528 A023529 A023530 this_sequence A023532 A023533 A023534
|
|
KEYWORD
|
nonn,easy,tabl,nice
|
|
AUTHOR
|
Clark Kimberling (ck6(AT)evansville.edu)
|
|
|
Search completed in 0.002 seconds
|
