Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A133744
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A133744 A062295(n) - A133743(n). +0
4
0, 0, 0, 0, 0, 0, 15, -19, -44, 0, 31, 33, 80, 43, 92, 0, 112, 305, 140, -77, 336, 261, 0, -103, -228, 129, 131, 268, 429, 292, -153, -805, -352, 189, 985, 2040, 1260, 440, -693, -468, 239, -2367, -1365, -285, 885, 596, 3531, 2608, 3360, 2752, -2196, 0, 2709, 4367, 4411, 2105 (list; graph; listen)
OFFSET

1,7

COMMENT

A062295 is the sequence of smallest squares such that the pairwise sums of not necessarily distinct elements are all distinct, whereas A133743 is the sequence of smallest squares such that the pairwise sums of distinct elements are all distinct.

LINKS

K. Brockhaus, Table of n, a(n) for n = 1..4944

EXAMPLE

a(7) = A062295(7) - A133743(7) = 64 - 49 = 15.

CROSSREFS

Cf. A062295, A133743, A133745.

Sequence in context: A077349 A104298 A032475 this_sequence A031112 A134617 A113529

Adjacent sequences: A133741 A133742 A133743 this_sequence A133745 A133746 A133747

KEYWORD

sign

AUTHOR

Klaus Brockhaus (klaus-brockhaus(AT)t-online.de), Sep 24 2007

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 4 21:35 EST 2008. Contains 151309 sequences.


AT&T Labs Research