cp's OEIS Frontend

A092433 Positive numbers from the children's game "Buzz" or "Sevens": positive integers which are divisible by seven, or which contain a seven as a digit.

%I A092433 #39 Jan 14 2025 01:42:54
%S A092433 7,14,17,21,27,28,35,37,42,47,49,56,57,63,67,70,71,72,73,74,75,76,77,
%T A092433 78,79,84,87,91,97,98,105,107,112,117,119,126,127,133,137,140,147,154,
%U A092433 157,161,167,168,170,171,172,173,174,175,176,177,178,179,182,187,189,196
%N A092433 Positive numbers from the children's game "Buzz" or "Sevens": positive integers which are divisible by seven, or which contain a seven as a digit.
%C A092433 Almost all integers are in this sequence: It has asymptotic density 1 since the percentage of n-digit numbers with no digit 7 tends to 0 as n -> oo. - _M. F. Hasler_, Oct 12 2020
%C A092433 Does not contain 114.
%H A092433 David A. Corneth, <a href="/A092433/b092433.txt">Table of n, a(n) for n = 1..10000</a>
%H A092433 Darren Gerson, <a href="http://www.gameskidsplay.net/games/xtra_games.htm#Buzz">Buzz</a>.
%H A092433 LoGirl, <a href="http://www.dailymotion.com/video/k5dvmUOmXCndCMiDzA0">The game 887</a>, Japanese TV program for junior high and primary school student, Jul 11 2016
%H A092433 Partygamecentral.com, <a href="http://www.partygamecentral.com/games.php?gnm=156&amp;flagtype=search&amp;searchquery=Buzz&amp;offset=0">Buzz</a> [broken link]
%H A092433 TeachingTips, <a href="https://web.archive.org/web/20050204081131/http://www.teachingtips.com/articles/Hgames1.html">Academic Games</a>, Buzz.
%F A092433 Integers n for which the coefficient of x^n is nonzero in x^7 / (1 - x^7) + Sum_{k>=0} x^(7*10^k)*(1 - x^(10^k)) / ((1 - x)*(1 - x^(10^(k+1)))).
%e A092433 7 is the first term, both because it is a multiple of 7 and because it contains a 7. 14 is next, being a multiple of 7. 17 is the third term: it contains a 7.
%p A092433 isA092433 := proc(n)
%p A092433     if modp(n,7) = 0 then
%p A092433         true;
%p A092433     else
%p A092433         convert(convert(n,base,10),set) ;
%p A092433         if 7 in % then
%p A092433             true;
%p A092433         else
%p A092433             false;
%p A092433         end if;
%p A092433     end if;
%p A092433 end proc:
%p A092433 for n from 1 to 200 do
%p A092433     if isA092433(n) then
%p A092433         printf("%d,",n);
%p A092433     end if;
%p A092433 end do: # _R. J. Mathar_, Jul 19 2016
%t A092433 Select[Range[300], Mod[ #, 7] == 0 || MemberQ[IntegerDigits[ # ], 7] &]
%o A092433 (PARI) is(n) = n % 7 == 0 || setsearch(Set(digits(n)),7) \\ _David A. Corneth_, Oct 01 2019, simplified by _M. F. Hasler_, Oct 12 2020
%Y A092433 Cf. A008589 (divisible by 7), A011537 (containing digit 7).
%Y A092433 Cf. A092451-A092457.
%Y A092433 Complement is A376047.
%K A092433 base,easy,nonn
%O A092433 1,1
%A A092433 Jim Ferry (jferry(AT)uiuc.edu), Mar 23 2004