Greetings from
The On-Line Encyclopedia of Integer Sequences
!
Hints
Search:
id:A157654
Displaying 1-1 of 1 results found.
page 1
Format:
long
| short |
internal
|
text
Sort: relevance |
references
|
number
Highlight: on |
off
A157654
Triangle read by rows:k=2; t(n,m)= If[n*m*(n - m) == 0, 1, Abs[(-k m^(k - 1) + k (-m + n)^(k - 1))]].
+0
1
1, 1, 1, 1, 0, 1, 1, 2, 2, 1, 1, 4, 0, 4, 1, 1, 6, 2, 2, 6, 1, 1, 8, 4, 0, 4, 8, 1, 1, 10, 6, 2, 2, 6, 10, 1, 1, 12, 8, 4, 0, 4, 8, 12, 1, 1, 14, 10, 6, 2, 2, 6, 10, 14, 1, 1, 16, 12, 8, 4, 0, 4, 8, 12, 16, 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 December 8 08:31 EST 2009. Contains 170430 sequences.
AT&T Labs Research
Legal Notice
© 2009 AT&T Intellectual Property.
All Rights Reserved.
