Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A074057
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A074057 2*phi(n-2)-(n-1). +0
1
0, -1, 0, -1, 2, -3, 4, -1, 2, -3, 8, -5, 10, -3, 0, -1, 14, -7, 16, -5, 2, -3, 20, -9, 14, -3, 8, -5, 26, -15, 28, -1, 6, -3, 12, -13, 34, -3, 8, -9, 38, -19, 40, -5, 2, -3, 44, -17, 34, -11, 12, -5, 50, -19, 24, -9, 14, -3, 56, -29, 58, -3, 8, -1, 30, -27, 64, -5, 18, -23, 68, -25, 70, -3, 4, -5, 42, -31, 76, -17, 26, -3, 80 (list; graph; listen)
OFFSET

3,5

COMMENT

Conjecture : a(n)=0 if and only if n is a Fermat prime

FORMULA

a(n)=-1 if n is of the form 2^x+2 a(n)=-3 if n is in a subsequence b(k) = 8, 12, 16, 24, 28, 36, 40, 48, 60, 64, 76, 84, 88, 96..( b(k) seems to be asymptotic to c*n*log(n) with c=2.28..)

CROSSREFS

Sequence in context: A033925 A064866 A024855 this_sequence A163258 A141063 A138223

Adjacent sequences: A074054 A074055 A074056 this_sequence A074058 A074059 A074060

KEYWORD

easy,sign

AUTHOR

Benoit Cloitre (benoit7848c(AT)orange.fr), Sep 15 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 November 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research