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.

A244073 Odd integers n such that for every integer k>0, n*2^k-1 has a divisor in the set {3, 5, 7, 13, 19, 73, 109}.

This page as a plain text file.
%I A244073 #30 Jul 12 2014 16:26:56
%S A244073 1744117,6975809,7790113,11942443,13006807,16861093,16882181,17207051,
%T A244073 20003369,20147891,21013423,25638127,42918821,45113083,47285977,
%U A244073 48635609,49884041,53335151,53538727,56592041,63412693,63750101,64062209,65739209
%N A244073 Odd integers n such that for every integer k>0, n*2^k-1 has a divisor in the set {3, 5, 7, 13, 19, 73, 109}.
%C A244073 For n > 144 a(n) = a(n-144) + 412729590, the first 144 values are in the table.
%H A244073 Pierre CAMI, <a href="/A244073/b244073.txt">Table of n, a(n) for n = 1..144</a>
%F A244073 For n > 144, a(n) = a(n-144) + 412729590.
%o A244073 (PFGW & SCRIPT)
%o A244073 SCRIPT
%o A244073 DIM n
%o A244073 DIM k,1
%o A244073 OPENFILEOUT myf,a(n).txt
%o A244073 LABEL loop1
%o A244073 SET k,k+2
%o A244073 SET n,0
%o A244073 LABEL a
%o A244073 SET n,n+1
%o A244073 IF n>500 THEN GOTO b
%o A244073 IF (k*(2^n)-1)%3==0 THEN GOTO a
%o A244073 IF (k*(2^n)-1)%5==0 THEN GOTO a
%o A244073 IF (k*(2^n)-1)%7==0 THEN GOTO a
%o A244073 IF (k*(2^n)-1)%13==0 THEN GOTO a
%o A244073 IF (k*(2^n)-1)%19==0 THEN GOTO a
%o A244073 IF (k*(2^n)-1)%73==0 THEN GOTO a
%o A244073 IF (k*(2^n)-1)%109==0 THEN GOTO a
%o A244073 GOTO loop1
%o A244073 LABEL b
%o A244073 WRITE myf,k
%o A244073 PRINT k
%o A244073 GOTO loop1
%Y A244073 Cf. A076337, A244070, A244071, A244072, A244074, A244076.
%K A244073 nonn
%O A244073 1,1
%A A244073 _Pierre CAMI_, Jun 19 2014