Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A115289
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A115289 a(n) is the smallest number representable in exactly n ways as a sum of one triangular number and 2 squares (each of them >= 0). +0
2
0, 1, 5, 10, 19, 26, 55, 46, 53, 116, 86, 128, 173, 145, 200, 170, 221, 235, 236, 305, 341, 326, 491, 425, 548, 431, 676, 530, 536, 635, 656, 851, 905, 695, 1118, 950, 1040, 1171, 1241, 1031, 1076, 1115, 1325, 1661, 1943, 1391, 1531, 1691, 1790, 1670, 2291, 2081 (list; graph; listen)
page 1

Search completed in 0.001 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 10 12:37 EST 2009. Contains 170569 sequences.


AT&T Labs Research