Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A107797
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A107797 EulerPhi of minimal Pisot sequence. +0
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; listen)
OFFSET

0,7

FORMULA

F[n] = F[n - 2] + F[n - 3] a(n) = EulerPhi[F[n]]

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: A088965 A059474 A078099 this_sequence A038759 A045999 A075569

Adjacent sequences: A107794 A107795 A107796 this_sequence A107798 A107799 A107800

KEYWORD

nonn,uned

AUTHOR

Roger L. Bagula (rlbagulatftn(AT)yahoo.com), Jun 11 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 July 26 23:19 EDT 2008. Contains 142293 sequences.


AT&T Labs Research