Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A058005
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A058005 a(n)=GCD[n,C(2n,n)]. +0
2
2, 2, 2, 2, 2, 12, 2, 2, 2, 4, 2, 4, 2, 4, 30, 2, 2, 12, 2, 20, 6, 4, 2, 12, 2, 4, 2, 56, 2, 4, 2, 2, 6, 4, 14, 4, 2, 4, 2, 20, 2, 84, 2, 8, 90, 4, 2, 12, 2, 4, 6, 8, 2, 12, 2, 8, 6, 4, 2, 24, 2, 4, 6, 2, 10, 132, 2, 4, 6, 20, 2, 36, 2, 4, 30, 8, 154, 12, 2, 20, 2, 4, 2, 56, 10, 4, 6, 88, 2, 20 (list; graph; listen)
OFFSET

0,1

EXAMPLE

a(n)=2 for values like 1,2,3,4,5,7,.. a(n)=2n for values like 6,15,...,190

CROSSREFS

A001405.

Sequence in context: A157279 A010671 A088050 this_sequence A095386 A060359 A029665

Adjacent sequences: A058002 A058003 A058004 this_sequence A058006 A058007 A058008

KEYWORD

nonn

AUTHOR

Labos E. (labos(AT)ana.sote.hu), Nov 13 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 November 25 14:49 EST 2009. Contains 167514 sequences.


AT&T Labs Research