Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A062777
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A062777 2^n - mu(n). +0
1
1, 5, 9, 16, 33, 63, 129, 256, 512, 1023, 2049, 4096, 8193, 16383, 32767, 65536, 131073, 262144, 524289, 1048576, 2097151, 4194303, 8388609, 16777216, 33554432, 67108863, 134217728, 268435456, 536870913, 1073741825, 2147483649 (list; graph; listen)
OFFSET

1,2

PROGRAM

(PARI) for(n=1, 22, print((2^n)-moebius(n)))

CROSSREFS

Sequence in context: A020713 A090990 A088495 this_sequence A102179 A097538 A001771

Adjacent sequences: A062774 A062775 A062776 this_sequence A062778 A062779 A062780

KEYWORD

easy,nonn

AUTHOR

Jason Earls (zevi_35711(AT)yahoo.com), Jul 18 2001

EXTENSIONS

More terms from Antonio G. Astudillo (afg_astudillo(AT)lycos.com), Mar 29 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 December 16 17:18 EST 2009. Contains 170825 sequences.


AT&T Labs Research