Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A123002
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A123002 Triangle read by rows: T(n, m) := 2^(n - 1)*(2*m - 1) - 2^(m - 1)*(2*n - 1). +0
1
0, -1, 0, -1, 2, 0, 1, 10, 12, 0, 7, 30, 44, 40, 0, 21, 74, 116, 136, 112, 0, 51, 166, 268, 344, 368, 288, 0, 113, 354, 580, 776, 912, 928, 704, 0, 239, 734, 1212, 1656, 2032, 2272, 2240, 1664, 0, 493, 1498, 2484, 3432, 4304, 5024, 5440, 5248, 3840, 0 (list; table; graph; listen)
OFFSET

1,5

COMMENT

Ulam commutator triangular array from a problem on Peano mappings.

REFERENCES

S. M. Ulam, Problems in Modern Mathematics,John Wiley and Sons, New York,1960, page 32

EXAMPLE

0

-1, 0

-1, 2, 0

1, 10, 12, 0

7, 30, 44, 40, 0

21, 74, 116, 136, 112, 0

MATHEMATICA

T[n_, m_] := 2^(n - 1)*(2*m - 1) - 2^(m - 1)*(2*n - 1); a = Table[Table[T[n, m], {m, 1, n}], {n, 1, 10}]; Flatten[a]

CROSSREFS

Sequence in context: A021836 A072551 A091803 this_sequence A137514 A158234 A069845

Adjacent sequences: A122999 A123000 A123001 this_sequence A123003 A123004 A123005

KEYWORD

sign,tabl

AUTHOR

Roger Bagula (rlbagulatftn(AT)yahoo.com), Sep 23 2006

EXTENSIONS

Edited by N. J. A. Sloane (njas(AT)research.att.com), Oct 01 2006

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 25 14:49 EST 2009. Contains 167514 sequences.


AT&T Labs Research