Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A130497
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A130497 Repetition of odd numbers five times. +0
1
1, 1, 1, 1, 1, 3, 3, 3, 3, 3, 5, 5, 5, 5, 5, 7, 7, 7, 7, 7, 9, 9, 9, 9, 9, 11, 11, 11, 11, 11, 13, 13, 13, 13, 13, 15, 15, 15, 15, 15, 17, 17, 17, 17, 17, 19, 19, 19, 19, 19, 21, 21, 21, 21, 21, 23, 23, 23, 23, 23, 25, 25, 25, 25, 25, 27, 27, 27, 27, 27, 29, 29, 29, 29, 29, 31, 31, 31 (list; graph; listen)
OFFSET

0,6

FORMULA

a(n)= -1 + 2*Sum_{k=0..n} {[8*(sin(2*Pi*k/5))^2-5]^2-5}/20, with n>=0. a(n)= -1 + 2*Sum_{k=0..n} 1/50*{-9*[k mod 5]+[(n+1) mod 5]+[(n+2) mod 5]+[(n+3) mod 5]+11*[(n+4) mod 5]}, with n>=0.

MAPLE

P:=proc(n) local i, j, k; for i from 0 by 1 to n do j:=-1+2*sum('(8*(sin(2*Pi*k/5))^2-5)^2-5', 'k'=0..i)/20 ; print(j); od; end: P(100);

CROSSREFS

Cf. A129756.

Sequence in context: A112593 A113215 A105591 this_sequence A126715 A105121 A092282

Adjacent sequences: A130494 A130495 A130496 this_sequence A130498 A130499 A130500

KEYWORD

easy,nonn

AUTHOR

Paolo P. Lava & Giorgio Balzarotti (ppl(AT)spl.at), May 31 2007

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 August 19 23:53 EDT 2008. Contains 142930 sequences.


AT&T Labs Research