Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A058656
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A058656 a(n)=GCD[n+1,Phi(n)]. +0
1
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; listen)
OFFSET

0,3

COMMENT

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.

CROSSREFS

A000010, A009195, A058515.

Sequence in context: A161302 A161277 A160981 this_sequence A033111 A078313 A025827

Adjacent sequences: A058653 A058654 A058655 this_sequence A058657 A058658 A058659

KEYWORD

nonn

AUTHOR

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

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 December 8 08:31 EST 2009. Contains 170430 sequences.


AT&T Labs Research