Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A087359
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A087359 For n > 2, a(n) is the smallest triangular number > a(n-1) and congruent to a(n-1) (mod a(n-2)). +0
2
1, 3, 6, 15, 21, 36, 78, 1770, 2628, 330078, 1160526, 1106921826, 27467109390, 3405462502501956, 464491597897585896, 35168538277628662422146736, 113107978211040574688911417114776, 158163225773885113469535108323447683287341095656 (list; graph; listen)
OFFSET

1,2

EXAMPLE

a(7) == a(6) (mod a(5)), -> 78 -36 = 42 = 2*21.

CROSSREFS

Cf. A087360.

Adjacent sequences: A087356 A087357 A087358 this_sequence A087360 A087361 A087362

Sequence in context: A117748 A061066 A093799 this_sequence A129602 A044888 A006639

KEYWORD

nonn

AUTHOR

Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Sep 08 2003

EXTENSIONS

More terms from David Wasserman (wasserma(AT)spawar.navy.mil), May 19 2005

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 08:31 EDT 2008. Contains 144667 sequences.


AT&T Labs Research