Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A140740
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A140740 Triangle read by rows: T(n,n) = 1 and for k with 1 <= k < n: T(n+1,k) = T(n,k) + T(n - n mod k, k). +0
7
1, 2, 1, 4, 2, 1, 8, 3, 2, 1, 16, 6, 3, 2, 1, 32, 9, 4, 3, 2, 1, 64, 18, 8, 4, 3, 2, 1, 128, 27, 12, 5, 4, 3, 2, 1, 256, 54, 16, 10, 5, 4, 3, 2, 1, 512, 81, 32, 15, 6, 5, 4, 3, 2, 1, 1024, 162, 48, 20, 12, 6, 5, 4, 3, 2, 1, 2048, 243, 64, 25, 18, 7, 6, 5, 4, 3, 2, 1, 4096, 486, 128, 50, 24 (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