Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A011906
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A011906 If b(n) is A011900 and c(n) is A001109, then a(n) = b(n)*c(n) = b(n) + (b(n)+1) + (b(n)+2) + ... + c(n). +0
1
1, 18, 525, 17340, 586177, 19896030, 675781821, 22956120408, 779829016225, 26491211221770 (list; graph; listen)
OFFSET

1,2

REFERENCES

Mario Velucchi "From the desk of ... Mario Velucchi" in 'Mathematics and Informatics quarterly' volume 7 - 2/1997, p. 81.

EXAMPLE

a(3) = 525 = 15*35 = 15 + 16 + ... + 35.

CROSSREFS

Adjacent sequences: A011903 A011904 A011905 this_sequence A011907 A011908 A011909

Sequence in context: A035023 A126276 A035277 this_sequence A133401 A061079 A003298

KEYWORD

nonn,easy

AUTHOR

Mario Velucchi (mathchess(AT)velucchi.it)

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 October 7 14:39 EDT 2008. Contains 144666 sequences.


AT&T Labs Research