Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A131870
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A131870 Period 8: repeat 1, 2, 3, 4, 6, 7, 8, 9. +0
1
1, 2, 3, 4, 6, 7, 8, 9, 1, 2, 3, 4, 6, 7, 8, 9, 1, 2, 3, 4, 6, 7, 8, 9, 1, 2, 3, 4, 6, 7, 8, 9, 1, 2, 3, 4, 6, 7, 8, 9, 1, 2, 3, 4, 6, 7, 8, 9, 1, 2, 3, 4, 6, 7, 8, 9, 1, 2, 3, 4, 6, 7, 8, 9, 1, 2, 3, 4, 6, 7, 8, 9, 1, 2, 3, 4, 6, 7, 8, 9, 1, 2, 3, 4, 6, 7, 8, 9, 1, 2, 3, 4, 6, 7, 8, 9, 1, 2, 3, 4, 6, 7, 8, 9, 1 (list; graph; listen)
OFFSET

0,2

COMMENT

Terms of the simple continued fraction of 1562/[3*sqrt(6536374)-6580]. [From Paolo P. Lava (ppl(AT)spl.at), Aug 06 2009]

FORMULA

a(n)=(1/56)*{66*(n mod 8)+3*[(n+1) mod 8]+3*[(n+2) mod 8]+3*[(n+3) mod 8]-4*[(n+4) mod 8]+3*[(n+5) mod 8]+3*[(n+6) mod 8]+3*[(n+7) mod 8]}, with n>=0. - Paolo P. Lava (ppl(AT)spl.at), Oct 08 2007

CROSSREFS

Cf. A071789.

Sequence in context: A089884 A086163 A071789 this_sequence A004724 A099260 A053241

Adjacent sequences: A131867 A131868 A131869 this_sequence A131871 A131872 A131873

KEYWORD

nonn

AUTHOR

Paul Curtz (bpcrtz(AT)free.fr), Oct 05 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 December 16 13:01 EST 2009. Contains 170825 sequences.


AT&T Labs Research