Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A083261
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A083261 a(n)=GCD[A046523(n+1), A046523(n)]. +0
1
1, 2, 2, 2, 2, 2, 2, 4, 2, 2, 2, 2, 2, 6, 2, 2, 2, 2, 2, 6, 6, 2, 2, 4, 2, 2, 4, 2, 2, 2, 2, 2, 6, 6, 6, 2, 2, 6, 6, 2, 2, 2, 2, 12, 6, 2, 2, 4, 4, 6, 6, 2, 2, 6, 6, 6, 6, 2, 2, 2, 2, 6, 4, 2, 6, 2, 2, 6, 6, 2, 2, 2, 2, 6, 12, 6, 6, 2, 2, 16, 2, 2, 2, 6, 6, 6, 6, 2, 2, 6, 6, 6, 6, 6, 6, 2, 2, 12, 12, 2, 2, 2, 2 (list; graph; listen)
OFFSET

1,2

CROSSREFS

Cf. A007395, A000040, A002808, A018252, A046523, A071364, A083255-A083260.

Adjacent sequences: A083258 A083259 A083260 this_sequence A083262 A083263 A083264

Sequence in context: A081305 A035665 A027388 this_sequence A003648 A003642 A100007

KEYWORD

nonn

AUTHOR

Labos E. (labos(AT)ana.sote.hu), May 09 2003

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 October 13 02:37 EDT 2008. Contains 145008 sequences.


AT&T Labs Research