Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

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

0,1

COMMENT

a(n)=2 for n=0,1,2 modulo 6; a(n)=1 for n=3,4,5 modulo 6 .

Terms of the simple continued fraction of 29/[2*sqrt(210)-17]. Decimal expansion of 667/3003. [From Paolo P. Lava (ppl(AT)spl.at), Aug 05 2009]

FORMULA

G.f.: (1+2x^3)/((1-x)(1+x)(1-x+x^2)). a(n)= 3/2 -(-1)^n/6-A057079(n)/3. [From R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Sep 17 2008]

a(n)=(1/30)*{8*(n mod 6)+3*[(n+1) mod 6]+3*[(n+2) mod 6]-2*[(n+3) mod 6]+3*[(n+4) mod 6]+3*[(n+5) mod 6]}, with n>=0 [From Paolo P. Lava (ppl(AT)spl.at), Sep 19 2008]

CROSSREFS

Cf. A135265

Sequence in context: A126067 A048858 A135265 this_sequence A076490 A124278 A139755

Adjacent sequences: A144107 A144108 A144109 this_sequence A144111 A144112 A144113

KEYWORD

nonn

AUTHOR

Philippe DELEHAM (kolotoko(AT)wanadoo.fr), Sep 11 2008, Sep 15 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 23 17:09 EST 2009. Contains 167438 sequences.


AT&T Labs Research