The OEIS is supported by the many generous donors to the OEIS Foundation.

 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 60th year, we have over 367,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A272576 a(n) = f(10, f(9, n)), where f(k,m) = floor(m*k/(k-1)). 1
 0, 1, 2, 3, 4, 5, 6, 7, 10, 11, 12, 13, 14, 15, 16, 17, 20, 21, 22, 23, 24, 25, 26, 27, 30, 31, 32, 33, 34, 35, 36, 37, 40, 41, 42, 43, 44, 45, 46, 47, 50, 51, 52, 53, 54, 55, 56, 57, 60, 61, 62, 63, 64, 65, 66, 67, 70, 71, 72, 73, 74, 75, 76, 77, 80, 81, 82, 83, 84, 85, 86, 87, 90 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,3 COMMENTS Also, numbers not ending with the digit 8 or 9. The initial terms coincide with those of A007094 and A039155. First disagreement is after 77 (index 63): a(64) = 80, A007094(64) = 100 and A039155(65) = 89. LINKS Table of n, a(n) for n=0..72. Index entries for linear recurrences with constant coefficients, signature (1,0,0,0,0,0,0,1,-1). Index entries for 10-automatic sequences. FORMULA G.f.: x*(1 + x + x^2 + x^3 + x^4 + x^5 + x^6 + 3*x^7)/((1 + x)*(1 - x)^2*(1 + x^2) *(1 + x^4)). a(n) = a(n-1) + a(n-8) - a(n-9). a(n) = 1.25n + O(1). - Charles R Greathouse IV, Nov 07 2022 MAPLE f := (k, m) -> floor(m*k/(k-1)): a := n -> f(10, f(9, n)): seq(a(n), n = 0..72); # Peter Luschny, May 03 2016 MATHEMATICA f[k_, m_] := Floor[m*k/(k-1)]; a[n_] := f[10, f[9, n]]; Table[a[n], {n, 0, 72}] (* Jean-François Alcover, May 09 2016 *) LinearRecurrence[{1, 0, 0, 0, 0, 0, 0, 1, -1}, {0, 1, 2, 3, 4, 5, 6, 7, 10}, 90] (* Harvey P. Dale, Jun 22 2017 *) PROG (Magma) k:=10; f:=func; [f(k, f(k-1, n)): n in [0..70]]; (Sage) f = lambda k, m: floor(m*k/(k-1)) a = lambda n: f(10, f(9, n)) [a(n) for n in range(73)] # Peter Luschny, May 03 2016 (PARI) is(n)=n%10<8 \\ Charles R Greathouse IV, Feb 13 2017 CROSSREFS Cf. similar sequences listed in A272574. Sequence in context: A336064 A039269 A039207 * A039155 A007094 A000433 Adjacent sequences: A272573 A272574 A272575 * A272577 A272578 A272579 KEYWORD nonn,easy,base AUTHOR Bruno Berselli, May 03 2016 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified December 2 18:55 EST 2023. Contains 367525 sequences. (Running on oeis4.)
{"found_math": false, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0}