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.

Showing 1-2 of 2 results.

A307008 Numbers that are both prime-indexed primes and lucky-indexed lucky numbers.

Original entry on oeis.org

31, 367, 991, 1087, 1471, 3259, 3559, 5851, 6661, 6841, 8719, 9661, 10723, 11953, 13513, 18181, 20341, 21529, 22651, 23563, 25057, 31189, 39451, 70207, 72727, 75937, 81931, 85843, 87931, 92569, 93169, 108643, 131071, 136483, 143797, 149503, 150991, 163309
Offset: 1

Views

Author

Amiram Eldar, Mar 19 2019

Keywords

Comments

Intersection of A006450 and A032639.

Crossrefs

Programs

  • Mathematica
    m = 10^4; L = Table[2*i + 1, {i, 0, m}]; For[n = 2, n < Length[L], r = L[[n++]]; L = ReplacePart[L, Table[r*i -> Nothing, {i, 1, Length[L]/r}]]]; ll = L[[Select[L, # <= Length[L] &]]]; pp = Prime@ Prime@ Range@ PrimePi@ PrimePi@ (2m); Intersection[pp,ll] (* after Jean-François Alcover at A000959 and Giovanni Resta at A303403 *)

A318487 Even numbers that are not the sum of two lucky-indexed lucky numbers.

Original entry on oeis.org

4, 6, 10, 12, 16, 18, 20, 24, 26, 30, 34, 36, 40, 44, 46, 48, 54, 58, 60, 66, 68, 72, 74, 76, 78, 82, 86, 90, 92, 96, 100, 102, 104, 106, 110, 114, 116, 120, 122, 124, 128, 130, 134, 138, 140, 144, 146, 152, 154, 156, 158, 164, 168, 170, 176, 178, 182, 184
Offset: 1

Views

Author

Amiram Eldar, Aug 27 2018

Keywords

Comments

Conjecture (checked up to 10^7): every even number larger than 199254 is the sum of two lucky-indexed lucky numbers, so this sequence is finite with 1714 terms.

Examples

			28 is not in this sequence since 28 = 7 + 21 and 7 and 21 are lucky-indexed lucky numbers (A032639).
		

Crossrefs

Programs

  • Mathematica
    L = Table[2*i + 1, {i, 0, 150000}]; For[n = 2, n < Length[L], r = L[[n++]]; L = ReplacePart[L, Table[r*i -> Nothing, {i, 1, Length[L]/r}]]]; a = L[[Select[L, # <= Length[L] &]]]; v = Select[Range[2, 300000, 2], IntegerPartitions[#, {2}, a] == {} &]; (* after Jean-François Alcover at A000959 and Giovanni Resta at A303403 *)
Showing 1-2 of 2 results.