Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A121343
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A121343 Fibonacci(n) mod n(n+1)/2. +0
2
0, 0, 1, 2, 3, 5, 8, 13, 21, 34, 0, 23, 66, 51, 62, 10, 35, 67, 19, 1, 45, 89, 1, 229, 168, 275, 298, 236, 319, 59, 155, 125, 309, 376, 407, 485, 630, 628, 419, 466, 615, 370, 517, 343, 663, 830, 988, 1033, 168, 624, 700, 746, 1167, 158, 872, 1105, 609, 610, 59, 1181, 0, 1, 125 (list; graph; listen)
OFFSET

0,4

FORMULA

A000045(n) modulo A000217(n).

EXAMPLE

a(11)=23 since Fib(11)=89==23(mod (11*12/2)).

MATHEMATICA

f[n_] := If[n == 0, 0, Mod[Fibonacci@n, n(n + 1)/2]]; f /@ Range[0, 62] (* Robert G. Wilson v, Aug 31 2006 *)

CROSSREFS

Cf. A000045, A023173, A000217, A096535.

Adjacent sequences: A121340 A121341 A121342 this_sequence A121344 A121345 A121346

Sequence in context: A117760 A111917 A013986 this_sequence A023439 A013987 A023440

KEYWORD

nonn

AUTHOR

njas, Aug 29 2006

EXTENSIONS

Edited by njas, Jul 01 2008 at the suggestion of R. J. Mathar

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 12 11:54 EDT 2008. Contains 144829 sequences.


AT&T Labs Research