Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A071622
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A071622 (-1)*Sum( k =1,n, (-1)^floor((4/3)^k) ). +0
1
1, 2, 1, 2, 1, 2, 3, 4, 5, 6, 7, 8, 7, 6, 5, 6, 7, 8, 7, 8, 7, 6, 7, 6, 5, 6, 5, 6, 7, 8, 7, 6, 7, 8, 7, 6, 5, 6, 7, 8, 9, 10, 11, 12, 11, 10, 9, 10, 11, 10, 9, 8, 7, 8, 7, 8, 7, 8, 9, 10, 9, 8, 9, 8, 9, 8, 7, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 14, 15, 14, 13, 12, 13, 12, 13, 12, 11, 10, 9, 10, 9 (list; graph; listen)
OFFSET

1,2

COMMENT

Conjecture : for n>2300, a(n) > ln(n)^2

PROGRAM

(PARI) for(n=1, 100, print1(-sum(i=1, n, sign((-1)^floor((4/3)^i))), ", "))

CROSSREFS

Cf. A071532.

Adjacent sequences: A071619 A071620 A071621 this_sequence A071623 A071624 A071625

Sequence in context: A139803 A058746 A080916 this_sequence A135990 A140715 A099986

KEYWORD

easy,nonn

AUTHOR

Benoit Cloitre (benoit7848c(AT)orange.fr), Jun 22 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 October 10 20:39 EDT 2008. Contains 144831 sequences.


AT&T Labs Research