login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A058656 a(n)=GCD[n+1,Phi(n)]. 0
1, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 3, 8, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 3, 2, 1, 2, 1, 2, 1, 2, 1, 12, 1, 2, 3, 8, 1, 2, 1, 2, 5, 2, 1, 2, 1, 2, 1, 4, 1, 2, 1, 8, 3, 2, 1, 2, 1, 2, 3, 4, 1, 6, 1, 2, 1, 2, 1, 2, 1, 2, 3, 4, 1, 6, 1, 2, 1, 2, 1, 2, 1, 2, 3, 8, 1, 2, 1, 4, 1, 2, 1, 24, 1, 2, 3, 20, 1, 2, 1 (list; graph; refs; listen; history; internal format)
OFFSET

0,3

COMMENTS

Compare sequences: GCD[x,Phi(n)], where x=n-1,n or n+1.

EXAMPLE

For n=12,13,14,15, n+1=13,14,15,16, Phi(n)=4,12,12,8 and a(n)=GCD[13,4],GCD[14,12],GCD[15,12],GCD[16,8]=1,2,3,8 resp.

MATHEMATICA

Table[GCD[n+1, EulerPhi[n]], {n, 110}] (* From Harvey P. Dale, Nov 17 2011 *)

CROSSREFS

A000010, A009195, A058515.

Sequence in context: A161302 A161277 A160981 * A184221 A033111 A078313

Adjacent sequences:  A058653 A058654 A058655 * A058657 A058658 A058659

KEYWORD

nonn

AUTHOR

Labos E. (labos(AT)ana.sote.hu), Dec 28 2000

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 14 15:39 EST 2012. Contains 205635 sequences.