Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A011920
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A011920 a(n) = b(n)*(b(n)+1) = b(n) + ... + c(n), where b(n) = A011916(n), c(n) = A011918(n). +0
2
12, 1980, 378840, 73419192, 14241916260, 2762844014580, 535977297450672, 103976830083273840, 3913064012542622257452 (list; graph; listen)
OFFSET

1,1

REFERENCES

Mario VELUCCHI "Seeing couples" in Recreational and Educational Computing, to appear 1997.

CROSSREFS

Sequence in context: A104009 A015028 A167745 this_sequence A004823 A009063 A012675

Adjacent sequences: A011917 A011918 A011919 this_sequence A011921 A011922 A011923

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


AT&T Labs Research