The On-Line Encyclopedia of Integer Sequences (OEIS)

A019516 revision #23

A019516

Delete all 2's, 3's, 5's and 7's from the sequence of nonnegative integers.

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, 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, 9, 80, 81, 8, 8, 84, 8, 86, 8, 88, 89, 90, 91, 9, 9, 94, 9, 96

(list; graph; refs; listen; history; text; internal format)

OFFSET

0,3

REFERENCES

F. Iacobescu, Smarandache Partition Type and Other Sequences, Bull. Pure Appl. Sciences, Vol. 16E, No. 2 (1997), pp. 237-240.

LINKS

Table of n, a(n) for n=0..76.

Robert Israel, Table of n, a(n) for n = 0..10000

F. Smarandache, Collected Papers, Vol. II

F. Smarandache, Sequences of Numbers Involved in Unsolved Problems.

Eric Weisstein's World of Mathematics, Smarandache Sequences

MAPLE

f:= proc(n) local L, i;

L:= subs(2=NULL, 3=NULL, 5=NULL, 7=NULL, convert(n, base, 10));

if L = [] then NULL else add(L[i]*10^(i-1), i=1..nops(L)) fi

end proc:

map(f, [$0..100]); # Robert Israel, Nov 21 2024

MATHEMATICA

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 *)

CROSSREFS

Sequence in context: A123870 A318708 A085049 * A031977 A225668 A091985

Adjacent sequences: A019513 A019514 A019515 * A019517 A019518 A019519

KEYWORD

base,nonn,look,changed

AUTHOR

R. Muller

EXTENSIONS

a(42) corrected and extended by T. D. Noe, Oct 18 2011

STATUS

approved