Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

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

1,2

LINKS

Harry J. Smith, Table of n, a(n) for n=1,...,1000

PROGRAM

(PARI) { t=1; for (n=1, 1000, d=numdiv(n+1); write("b060778.txt", n, " ", gcd(d, t)); t=d; ) } [From Harry J. Smith (hjsmithh(AT)sbcglobal.net), Jul 11 2009]

CROSSREFS

A057921, A000005.

Sequence in context: A026465 A051486 A081355 this_sequence A096492 A053874 A123245

Adjacent sequences: A060775 A060776 A060777 this_sequence A060779 A060780 A060781

KEYWORD

nonn

AUTHOR

Labos E. (labos(AT)ana.sote.hu), Apr 26 2001

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 08:46 EST 2009. Contains 167481 sequences.


AT&T Labs Research