Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A081536
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A081536 Let f(n) be smallest number k which is a sum of n distinct numbers whose LCM is a multiple of k. Sequence gives triangle read by rows in which n-th row consists of those n numbers (row 2 is 0, 0 by convention). +0
4
1, 0, 0, 1, 2, 3, 3, 4, 5, 8, 1, 2, 3, 4, 5 (list; table; graph; listen)
OFFSET

1,5

FORMULA

a(n) = sigma(A005179(n)).

EXAMPLE

1; 0,0; 1,2,3; 3,4,5,8; 1,2,3,4,5; ...

CROSSREFS

Cf. A081535, A081537, A081538.

Sequence in context: A094979 A065565 A017842 this_sequence A023154 A070820 A031501

Adjacent sequences: A081533 A081534 A081535 this_sequence A081537 A081538 A081539

KEYWORD

tabl,more,nonn

AUTHOR

Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Mar 28 2003

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 July 6 17:22 EDT 2008. Contains 140988 sequences.


AT&T Labs Research