login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A350087 a(n) = A000032(n)^A000032(n+1) mod A000032(n+2). 1
2, 1, 4, 5, 13, 4, 16, 33, 64, 137, 123, 5, 733, 1241, 786, 235, 4331, 721, 13156, 18253, 32935, 37347, 24281, 34270, 127055, 370341, 630347, 52210, 76027, 255327, 2279978, 1527009, 10107310, 13246385, 17943817, 1128698, 75596554, 135885089, 46740145, 143055674, 76508345, 850178467, 978803396 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,1

LINKS

Robert Israel, Table of n, a(n) for n = 0..4762

EXAMPLE

a(3) = 4^7 mod 11 = 5.

MAPLE

luc:= n -> combinat:-fibonacci(n-1)+combinat:-fibonacci(n+1):

f:= n -> luc(n) &^ luc(n+1) mod luc(n+2):

map(f, [$0..50]);

MATHEMATICA

Table[PowerMod @@ LucasL[n + {0, 1, 2}], {n, 0, 50}] (* Amiram Eldar, Dec 23 2021 *)

PROG

(Python)

from gmpy2 import lucas2

def A350087(n):

    a, b = lucas2(n+1)

    return pow(b, a, a+b) # Chai Wah Wu, Dec 28 2021

CROSSREFS

Cf. A000032, A350253.

Sequence in context: A137224 A191830 A155944 * A091232 A336398 A209337

Adjacent sequences:  A350084 A350085 A350086 * A350088 A350089 A350090

KEYWORD

nonn

AUTHOR

J. M. Bergot and Robert Israel, Dec 22 2021

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 25 03:12 EDT 2022. Contains 356953 sequences. (Running on oeis4.)