cp's OEIS Frontend

A285767 Cyclops octagonal numbers: a(n) = n*(3*n-2) with one "zero" digit in the middle.

%I A285767 #14 Aug 01 2023 15:37:13
%S A285767 0,408,11041,18096,22016,23056,28033,38081,56033,61061,1140833,
%T A285767 1170625,1250656,1410416,1460216,1540833,2120161,2130261,2140385,
%U A285767 2150533,2310896,2390561,2460696,2520833,2570576,2780181,2920533,3230256,3280256,3490565,3660865,3680776
%N A285767 Cyclops octagonal numbers: a(n) = n*(3*n-2) with one "zero" digit in the middle.
%C A285767 The n-th octagonal number x(n) = n*(3*n - 2).
%C A285767 Subset of A000567.
%C A285767 All the terms have the number of digits odd with only one "zero" digit in the middle.
%e A285767 For n = 12; x(12) = 12*(3*12 - 2) = 408 that is 12th octagonal number with one zero digit in the middle, hence appears in the sequence.
%e A285767 For n = 61; x(61) = 61*(3*61 - 2) = 11041 that is 61st octagonal number with one zero digit in the middle, hence appears in the sequence.
%p A285767 iscyclops:= proc(n) local L,t;
%p A285767 t:= ilog10(n);
%p A285767 if t::odd then return false fi;
%p A285767 L:= convert(n,base,10);
%p A285767 L[1+t/2] = 0 and numboccur(0,L) = 1
%p A285767 end proc:
%p A285767 iscyclops(0):= true:
%p A285767 select(iscyclops, [seq(n*(3*n-2),n=0..1000)]);
%t A285767 Select[Table[n (3 n - 2), {n, 0, 1110}], And[OddQ@ Length@ #, Count[#, 0] == 1, Take[#, {Ceiling[Length[#]/2]}] == {0}] &@ IntegerDigits@ # &] (* _Michael De Vlieger_, Apr 26 2017 *)
%Y A285767 Intersection of A000567 and A134808.
%Y A285767 Cf. A000567, A134808, A134809, A160717.
%K A285767 nonn,base
%O A285767 1,2
%A A285767 _K. D. Bajpai_, Apr 25 2017