Greetings from
The On-Line Encyclopedia of Integer Sequences
!
Hints
Search:
id:A136406
Displaying 1-1 of 1 results found.
page 1
Format:
long
| short |
internal
|
text
Sort: relevance |
references
|
number
Highlight: on |
off
A136406
Array read by rows: T(n,k) is the number of bi-partitions of the pair (n,k) into pairs (n_i,k_i) of positive integers such that sum k_i = k and sum n_i.k_i^2 = n.
+0
3
1, 1, 1, 1, 1, 1, 1, 3, 1, 1, 1, 2, 3, 1, 1, 1, 3, 4, 3, 1, 1, 1, 3, 5, 4, 3, 1, 1, 1, 5, 6, 8, 4, 3, 1, 1, 1, 4, 10, 8, 8, 4, 3, 1, 1, 1, 5, 10, 14, 11, 8, 4, 3, 1, 1, 1, 5, 12, 16, 17, 11, 8, 4, 3, 1, 1, 1
(
list
;
table
;
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 November 29 12:46 EST 2009. Contains 167659 sequences.
AT&T Labs Research
Legal Notice
© 2009 AT&T Intellectual Property.
All Rights Reserved.
