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!)
A338736 a(n) = L(L(n)) mod n, where L = Lucas numbers = A000032. 4
0, 0, 1, 1, 4, 0, 3, 7, 7, 4, 10, 3, 9, 10, 7, 15, 12, 0, 10, 9, 7, 4, 22, 3, 1, 4, 7, 1, 4, 18, 30, 31, 7, 4, 29, 15, 1, 34, 34, 39, 35, 24, 29, 29, 7, 4, 46, 3, 1, 4, 7, 29, 29, 0, 21, 55, 7, 54, 35, 3, 45, 4, 7, 63, 64, 36, 2, 29, 7, 4, 6, 3, 43, 4, 7, 29 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,5
LINKS
FORMULA
a(n) = A005371(n) mod n.
MAPLE
b:= proc(n) local r, M, p; r, M, p:=
<<1|0>, <0|1>>, <<0|1>, <1|1>>, n;
do if irem(p, 2, 'p')=1 then r:=
`if`(nargs=1, r.M, r.M mod args[2]) fi;
if p=0 then break fi; M:=
`if`(nargs=1, M.M, M.M mod args[2])
od; (r.<<2, 1>>)[1$2]
end:
a:= n-> (f-> b(f, n) mod n)(b(n)):
seq(a(n), n=1..80);
CROSSREFS
Sequence in context: A338656 A153615 A352718 * A281531 A248914 A373462
KEYWORD
nonn,look
AUTHOR
Alois P. Heinz, Nov 05 2020
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 August 11 10:58 EDT 2024. Contains 375068 sequences. (Running on oeis4.)