cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A338841 No odd digit is present in a(n) * a(n+1).

This page as a plain text file.
%I A338841 #20 Nov 20 2020 21:57:04
%S A338841 0,1,2,3,8,5,4,6,7,12,17,24,10,20,11,22,13,16,14,19,32,9,52,39,58,36,
%T A338841 18,26,31,28,15,40,21,42,53,54,46,44,47,60,34,59,38,69,94,30,68,33,62,
%U A338841 43,48,50,56,73,88,23,96,25,80,35,64,41,104,27,84,51,122,71,66,37,72,29,76,79,112,74,63,102,61
%N A338841 No odd digit is present in a(n) * a(n+1).
%C A338841 This is the lexicographically earliest sequence of distinct nonnegative terms with this property and also a permutation of the nonnegative integers.
%H A338841 Carole Dubois, <a href="/A338841/b338841.txt">Table of n, a(n) for n = 1..5000</a>
%H A338841 <a href="/index/Per#IntegerPermutation">Index entries for sequences that are permutations of the nonnegative integers</a>
%e A338841 a(1) * a(2) = 0 * 1 = 0 (no odd digit is present);
%e A338841 a(2) * a(3) = 1 * 2 = 2 (no odd digit is present);
%e A338841 a(3) * a(4) = 2 * 3 = 6 (no odd digit is present);
%e A338841 a(4) * a(5) = 3 * 8 = 24 (no odd digit is present); etc.
%t A338841 Block[{a = {0}}, Do[Block[{k = 1}, While[Nand[FreeQ[a, k], NoneTrue[IntegerDigits@ Total[a[[-1]]*k], OddQ]], k++]; AppendTo[a, k]], {i, 2, 79}]; a] (* _Michael De Vlieger_, Nov 12 2020 *)
%Y A338841 Cf. A014263 (no odd digits).
%Y A338841 Cf. A338839, A338840, A338842, A338843, A338844, A338845, A338846 (variants on the same idea).
%K A338841 nonn,base,look
%O A338841 1,3
%A A338841 _Eric Angelini_ and _Carole Dubois_, Nov 11 2020