Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A137798
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A137798 Partial sums of A137797. +0
2
0, 0, 4, 8, 16, 14, 16, 18, 24, 30, 30, 30, 34, 38, 46, 44, 46, 48, 54, 60, 60, 60, 64, 68, 76, 74, 76, 78, 84, 90, 90, 90, 94, 98, 106, 104, 106, 108, 114, 120, 120, 120, 124, 128, 136, 134, 136, 138, 144, 150, 150, 150, 154, 158, 166, 164, 166, 168, 174, 180, 180, 180 (list; graph; listen)
OFFSET

0,3

FORMULA

f(n) = Sum{k=0,n} 2*[(k+1) mod 5] - 2*[(k+1) mod 2]

PROGRAM

Python (Complete):

.Sequence = []

.l = range('Choose Range')

.while len(l) > 0:

... a = l.pop(0)

... z = sum(2*((x+1)%5)-2*((x+1)%2) for x in range(a))

... Sequence.append(z)

.print Sequence

CROSSREFS

Cf. A137797.

Sequence in context: A111988 A110652 A059373 this_sequence A099212 A045534 A166634

Adjacent sequences: A137795 A137796 A137797 this_sequence A137799 A137800 A137801

KEYWORD

easy,nonn

AUTHOR

William A. Tedeschi (fynmun(AT)hotmail.com), Feb 10 2008

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 27 22:38 EST 2009. Contains 167602 sequences.


AT&T Labs Research