Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A066788
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A066788 GCD( phi(n), n^2 + 1). +0
1
1, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 5, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 10, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 5, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 10, 1, 2, 1, 2, 5, 2, 1, 2, 1, 2, 5, 2, 1, 2, 1, 10, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2 (list; graph; listen)
OFFSET

1,3

CROSSREFS

Adjacent sequences: A066785 A066786 A066787 this_sequence A066789 A066790 A066791

Sequence in context: A000034 A040001 A134451 this_sequence A023126 A082898 A095999

KEYWORD

nonn

AUTHOR

Benoit Cloitre (benoit7848c(AT)orange.fr), Jan 18 2002

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 May 16 01:24 EDT 2008. Contains 139630 sequences.


AT&T Labs Research