Greetings from
The On-Line Encyclopedia of Integer Sequences
!
Hints
Search:
id:A026378
Displaying 1-1 of 1 results found.
page 1
Format:
long
| short |
internal
|
text
Sort: relevance |
references
|
number
Highlight: on |
off
A026378
a(n) = number of integer strings s(0),...,s(n) counted by array T in
A026374
that have s(n)=1; also a(n)=T(2n-1,n-1).
+0
16
1, 4, 17, 75, 339, 1558, 7247, 34016, 160795, 764388, 3650571, 17501619, 84179877, 406020930, 1963073865, 9511333155, 46169418195, 224484046660, 1093097083475, 5329784874185, 26018549129545, 127154354598330, 622031993807565
(
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 2 11:54 EST 2009. Contains 167921 sequences.
AT&T Labs Research
Legal Notice
© 2009 AT&T Intellectual Property.
All Rights Reserved.
