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!)
A107797 a(n) = phi(Padovan(n+4)). 1
0, 1, 1, 1, 1, 1, 2, 2, 4, 6, 6, 4, 8, 12, 12, 36, 42, 48, 42, 36, 150, 80, 208, 216, 240, 240, 256, 1012, 712, 1620, 2148, 3328, 1008, 2772, 7560, 4640, 9036, 11988, 23832, 10512, 20896, 37968, 35960, 88380, 122004, 72000, 77472, 149712, 271824, 168960 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,7
LINKS
FORMULA
a(n) = A000010(A000931(n+4)). - R. J. Mathar, Sep 11 2011
MAPLE
A107797 := proc(n)
numtheory[phi](A000931(n+4)) ;
end proc:
seq(A107797(n), n=0..50) ; # R. J. Mathar, Sep 11 2011
MATHEMATICA
(*Method one*) M = {{0, 1, 0}, {0, 0, 1}, {1, 1, 0}} v[1] = {0, 1, 1} v[n_] := v[n] = M.v[n - 1] a = Table[EulerPhi[v[n][[1]]], {n, 1, 50}] (Method two*) F[1] = 0; F[2] = 1; F[3] = 1; F[n__] := F[n] = F[n - 2] + F[n - 3] a = Table[EulerPhi[F[n]], {n, 1, 50}]
CROSSREFS
Cf. A000931.
Sequence in context: A347797 A351746 A118960 * A316788 A038759 A045999
KEYWORD
nonn
AUTHOR
Roger L. Bagula, Jun 11 2005
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 May 10 02:43 EDT 2024. Contains 372354 sequences. (Running on oeis4.)