Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

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

0,2

COMMENT

The last digit of A108981(n).

Also the continued fraction of (290003+sqrt(240183699293))/652402.

Also the decimal expansion of 13073/81819.

The period contains each of the the 5 odd digits twice.

FORMULA

a(n)+a(n+5) = 10 = A010692(n).

a(n) = a(n+10) .

a(10*k+9+i) = a(10*k+18-i) (palindromic).

a(n) = 2*a(n-1)-2*a(n-2)+2*a(n-3)-2*a(n-4)+a(n-5). G.f.: -(1+3*x+x^2-3*x^3+3*x^4)/ ((x-1) * (x^4-x^3+x^2-x+1)).

a(n)=(1/45)*{14*(n mod 10)+5*[(n+1) mod 10]-4*[(n+2) mod 10]+23*[(n+3) mod 10]+23*[(n+4) mod 10]-4*[(n+5) mod 10]+5*[(n+6) mod 10]+14*[(n+7) mod 10]-13*[(n+8) mod 10]-13*[(n+9) mod 10]}, with n>=0 - Paolo P. Lava (ppl(AT)spl.at), Jul 14 2008

CROSSREFS

Sequence in context: A118309 A100106 A125650 this_sequence A086055 A077125 A160050

Adjacent sequences: A140721 A140722 A140723 this_sequence A140725 A140726 A140727

KEYWORD

nonn,easy

AUTHOR

Paul Curtz (bpcrtz(AT)free.fr), Jul 12 2008

EXTENSIONS

Edited by R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Sep 07 2009

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