Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

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

1,1

COMMENT

The period contains all digits from 0 to 8 and is a permutation of A141726.

Also the continued fractions of (13475+sqrt(212576401))/8952 and the decimal expansion of 414016720/111111111.

FORMULA

a(n)= A141694(n) mod 9 .

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

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

CROSSREFS

Sequence in context: A016618 A130789 A023529 this_sequence A159759 A163917 A063041

Adjacent sequences: A142066 A142067 A142068 this_sequence A142070 A142071 A142072

KEYWORD

nonn,easy

AUTHOR

Paul Curtz (bpcrtz(AT)free.fr), Sep 14 2008

EXTENSIONS

Edited for readability - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Sep 11 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 December 10 12:09 EST 2009. Contains 170569 sequences.


AT&T Labs Research