Greetings from
The On-Line Encyclopedia of Integer Sequences
!
Hints
Search:
id:A026375
Displaying 1-1 of 1 results found.
page 1
Format:
long
| short |
internal
|
text
Sort: relevance |
references
|
number
Highlight: on |
off
A026375
a(n) = number of integer strings s(0),...,s(n) counted by array T in
A026374
that have s(n)=0; also a(n)=T(2n,n).
+0
20
1, 3, 11, 45, 195, 873, 3989, 18483, 86515, 408105, 1936881, 9238023, 44241261, 212601015, 1024642875, 4950790605, 23973456915, 116312293305, 565280386625, 2751474553575, 13411044301945, 65448142561035, 319756851757695
(
list
;
graph
;
listen
)
page 1
Search completed in 0.002 seconds
Lookup
|
Welcome
|
Find friends
|
Music
|
Plot 2
|
Demos
|
Index
|
Browse
|
More
|
WebCam
Contribute new seq. or comment
|
Format
|
Transforms
|
Puzzles
|
Hot
|
Classics
More pages
|
Superseeker
|
Maintained by
N. J. A. Sloane
(
njas@research.att.com
)
Last modified December 5 23:38 EST 2009. Contains 170428 sequences.
AT&T Labs Research
Legal Notice
© 2009 AT&T Intellectual Property.
All Rights Reserved.
