Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A077099
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A077099 a(n)=gcd(A051612(n), A065387(n)), where A051612(n) = sigma(n) - phi(n) and A065387(n) = sigma(n) + phi(n). +0
6
2, 2, 2, 1, 2, 2, 2, 1, 1, 2, 2, 8, 2, 6, 16, 1, 2, 3, 2, 2, 4, 2, 2, 4, 1, 6, 2, 4, 2, 16, 2, 1, 4, 2, 24, 1, 2, 6, 16, 2, 2, 12, 2, 8, 6, 2, 2, 4, 3, 1, 8, 2, 2, 6, 16, 48, 4, 2, 2, 8, 2, 6, 4, 1, 12, 4, 2, 2, 4, 24, 2, 3, 2, 6, 4, 8, 12, 48, 2, 2, 1, 2, 2, 8, 4, 6, 16, 20, 2, 6, 8, 4, 4, 2, 48, 4, 2, 3 (list; graph; listen)
OFFSET

1,1

EXAMPLE

If a(n)=1, then n is either square or twice a square.

CROSSREFS

Cf. A000203, A000010, A051612, A065387.

Sequence in context: A067597 A139394 A125829 this_sequence A160385 A076881 A136754

Adjacent sequences: A077096 A077097 A077098 this_sequence A077100 A077101 A077102

KEYWORD

nonn

AUTHOR

Labos E. (labos(AT)ana.sote.hu), Nov 06 2002

EXTENSIONS

Edited by Dean Hickerson (dean.hickerson(AT)yahoo.com), Nov 07 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 December 1 19:22 EST 2009. Contains 167811 sequences.


AT&T Labs Research