|
|
A248375
|
|
a(n) = floor(9*n/8).
|
|
6
|
|
|
0, 1, 2, 3, 4, 5, 6, 7, 9, 10, 11, 12, 13, 14, 15, 16, 18, 19, 20, 21, 22, 23, 24, 25, 27, 28, 29, 30, 31, 32, 33, 34, 36, 37, 38, 39, 40, 41, 42, 43, 45, 46, 47, 48, 49, 50, 51, 52, 54, 55, 56, 57, 58, 59, 60, 61, 63, 64, 65, 66, 67, 68, 69, 70, 72, 73, 74, 75, 76, 77, 78, 79, 81, 82, 83, 84, 85, 86, 87, 88, 90, 91, 92, 93, 94, 95
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,3
|
|
COMMENTS
|
Also: numbers not congruent to 8 (mod 9), or numbers whose base-9 expansion does not end in the digit "8".
Paz proves that for all n>0 there is a prime in Breusch's interval [n; a(n+3)], cf A248371.
|
|
LINKS
|
|
|
FORMULA
|
G.f.: x*(1 + x + x^2 + x^3 + x^4 + x^5 + x^6 + 2*x^7) / ((1 + x)*(1 - x)^2*(1 + x^2)*(1 + x^4)). [Bruno Berselli, Oct 06 2014]
a(n) = n + floor(n/8) = a(n-1) + a(n-8) - a(n-9). [Bruno Berselli, Oct 06 2014]
|
|
MATHEMATICA
|
|
|
PROG
|
(PARI) a(n)=9*n\8
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|