Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A162868
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A162868 Lowest common multiple of all squares and all sums of two squares up to n^2+n^2 +0
1
1, 2, 40, 4680, 1591200, 1891936800, 4270101357600, 11089453225687200, 32565776278494961756800, 28429922691126101613686400, 42204464874461454985621846571472000 (list; graph; listen)
OFFSET

0,2

COMMENT

Also the lowest common multiple of all rows of triangle A069011 up to the nth row.

LCM(0) is taken to be 1, which follows from 0! = 1

FORMULA

a(n) = LCM({ x,y:N | 0 <= x <= y <= n; x^2+y^2 })

EXAMPLE

a(3) = LCM(0^2+0^2; 0^2+1^2, 1^2+1^2; 0^2+2^2, 1^2+2^2, 2^2+2^2; 0^2+3^2, 1^2+3^2, 2^2+3^2, 3^2+3^2) = LCM(0; 1, 2; 4, 5, 8; 9, 10, 13, 18) = 4680

CROSSREFS

Cf. A069011, A001481

Sequence in context: A060079 A052502 A104134 this_sequence A059476 A062769 A033841

Adjacent sequences: A162865 A162866 A162867 this_sequence A162869 A162870 A162871

KEYWORD

easy,nonn

AUTHOR

Carl R. White (oeisfan(AT)phodd.net), Jul 15 2009

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 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research