login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A105396
A simple "Fractal Jump Sequence" (FJS).
3
3, 6, 6, 3, 6, 6, 3, 6, 6, 3, 6, 6, 3, 6, 6, 3, 6, 6, 3, 6, 6, 3, 6, 6, 3, 6, 6, 3, 6, 6, 3, 6, 6, 3, 6, 6, 3, 6, 6, 3, 6, 6, 3, 6, 6, 3, 6, 6, 3, 6, 6, 3, 6, 6, 3, 6, 6, 3, 6, 6, 3, 6, 6, 3, 6, 6, 3, 6, 6, 3, 6, 6, 3, 6, 6, 3, 6, 6, 3, 6, 6, 3, 6, 6, 3, 6, 6, 3, 6, 6, 3, 6, 6, 3, 6, 6, 3, 6, 6, 3, 6, 6, 3, 6, 6
OFFSET
3,1
COMMENTS
See A105397 for definition of Fractal Jump Sequence.
From Vincenzo Librandi, Nov 13 2010: (Start)
First digit after the decimal point in the decimal expansion of (n^2 - 2)/3 (with n > 2). Examples:
for n=3, (3^2-2)/3 = 2.(3);
for n=4, (4^2-2)/3 = 4.(6);
for n=5, (5^2-2)/3 = 7.(6);
for n=6, (6^2-2)/3 = 11.(3);
for n=7, (7^2-2)/3 = 15.(6). (End)
FORMULA
From Robert Israel, Aug 04 2019: (Start)
a(n)=3 if 3|n, otherwise a(n)=6.
G.f.: 3*(1+2*x+2*x^2)*x^3/(1-x^3). (End)
CROSSREFS
Equals 3*A130196.
Sequence in context: A354952 A016662 A258271 * A247685 A372367 A185735
KEYWORD
base,easy,nonn
AUTHOR
Eric Angelini, May 01 2005
STATUS
approved