Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A071640
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A071640 a(n) = sum(i=1, n, A040051(i) ). +0
3
1, 1, 2, 3, 4, 5, 6, 6, 6, 6, 6, 7, 8, 9, 9, 10, 11, 12, 12, 13, 13, 13, 14, 15, 15, 15, 15, 15, 16, 16, 16, 17, 18, 18, 19, 20, 21, 22, 23, 23, 24, 24, 25, 26, 26, 26, 26, 27, 28, 28, 29, 30, 31, 32, 32, 33, 33, 33, 33, 34, 35, 35, 36, 36, 36, 36, 37, 38, 39, 39, 40, 41, 42, 42 (list; graph; listen)
OFFSET

1,3

COMMENT

Does 2*a(n) > n for n>2? Cf. A086144.

PROGRAM

(PARI) for(n=1, 150, print1(sum(i=1, n, (1-(-1)^(polcoeff(1/eta(x), i, x)))/2), ", "))

CROSSREFS

Cf. A000041, A086144, A040051, A087177.

Sequence in context: A034151 A101272 A006160 this_sequence A102674 A097623 A069754

Adjacent sequences: A071637 A071638 A071639 this_sequence A071641 A071642 A071643

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 November 29 12:46 EST 2009. Contains 167659 sequences.


AT&T Labs Research