# Greetings from The On-Line Encyclopedia of Integer Sequences! http://oeis.org/

Search: id:a019516
Showing 1-1 of 1

%I A019516 #24 Nov 21 2024 16:40:53
%S A019516 0,1,4,6,8,9,10,11,1,1,14,1,16,1,18,19,0,1,4,6,8,9,0,1,4,6,8,9,40,41,
%T A019516 4,4,44,4,46,4,48,49,0,1,4,6,8,9,60,61,6,6,64,6,66,6,68,69,0,1,4,6,8,
%U A019516 9,80,81,8,8,84,8,86,8,88,89,90,91,9,9,94,9,96
%N A019516 Delete all 2's, 3's, 5's and 7's from the sequence of nonnegative integers.
%D A019516 F. Iacobescu, Smarandache Partition Type and Other Sequences, Bull. Pure Appl. Sciences, Vol. 16E, No. 2 (1997), pp. 237-240.
%H A019516 Robert Israel, <a href="/A019516/b019516.txt">Table of n, a(n) for n = 0..10000</a>
%H A019516 F. Smarandache, <a href="http://www.gallup.unm.edu/~smarandache/CP2.pdf">Collected Papers, Vol. II</a>
%H A019516 F. Smarandache, <a href="http://www.gallup.unm.edu/~smarandache/Sequences-book.pdf">Sequences of Numbers Involved in Unsolved Problems</a>.
%H A019516 Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/SmarandacheSequences.html">Smarandache Sequences</a>
%p A019516 f:= proc(n) local L,i;
%p A019516    L:= subs(2=NULL, 3=NULL, 5=NULL, 7=NULL, convert(n,base,10));
%p A019516    if L = [] then NULL else add(L[i]*10^(i-1),i=1..nops(L)) fi
%p A019516 end proc:
%p A019516 map(f, [$0..100]); # _Robert Israel_, Nov 21 2024
%t A019516 t = Table[IntegerDigits[n], {n, 0, 100}]; t2 = Table[Select[t[[i]], ! MemberQ[{2, 3, 5, 7}, #] &], {i, Length[t]}]; t3 = DeleteCases[t2, {}]; FromDigits /@ t3 (* _T. D. Noe_, Oct 18 2011 *)
%K A019516 base,nonn,look,changed
%O A019516 0,3
%A A019516 R. Muller
%E A019516 a(42) corrected and extended by _T. D. Noe_, Oct 18 2011

# Content is available under The OEIS End-User License Agreement: http://oeis.org/LICENSE