A029947 -id:A029947 - cp's OEIS frontend

A029946 a(n)^3 contains n-th prime as a substring.

3, 7, 5, 3, 45, 11, 12, 13, 47, 9, 11, 15, 81, 7, 63, 37, 19, 21, 23, 83, 46, 31, 18, 29, 13, 106, 47, 221, 103, 225, 238, 236, 255, 225, 285, 205, 54, 168, 23, 161, 148, 122, 106, 57, 13, 271, 171, 247, 497, 132, 177, 198, 148, 136, 137, 133, 61, 358

Offset: 1

Patrick De Geest

John Cerkan, Table of n, a(n) for n = 1..10000

Cf. A029944, A029947.

Table[Function[p, k = 1; While[Length@ SequencePosition[ IntegerDigits[Set[c, k^3]], p] == 0, k++]; c]@ IntegerDigits@ Prime@ n, {n, 58}] ^(1/3) (* Michael De Vlieger, May 04 2017, Version 10.1 *)

A178983 The smallest cube containing n as a substring.

Original entry on oeis.org

0, 1, 27, 343, 64, 125, 64, 27, 8, 729, 1000, 91125, 125, 1331, 140608, 15625, 216, 1728, 85184, 2197, 205379, 216, 226981, 103823, 13824, 125, 9261, 27, 1728, 729, 39304, 1331, 5832, 1331, 343, 35937, 97336, 3375, 13824, 39304, 4096, 531441, 42875, 343

Offset: 0

Andy Martin, Jan 02 2011

			a(3) = 7^3 = 343, because it contains 3 as a substring and no smaller cube contains 3.

T. D. Noe, Table of n, a(n) for n = 0..1000

Cf. A029943, A029947.

subs[n_] := Module[{d = IntegerDigits[n], len}, len = Length[d]; Union[Flatten[Table[FromDigits[Take[d, {i, k}]], {k, len}, {i, k}]]]]; Table[k = 0; While[! MemberQ[subs[k^3], n], k++]; k^3, {n, 0, 100}] (* T. D. Noe, Nov 06 2013 *)
With[{cbs=Range[0,100]^3},Table[SelectFirst[cbs,SequenceCount[IntegerDigits[#],IntegerDigits[n]]>0&],{n,0,50}]] (* Harvey P. Dale, Nov 17 2024 *)

# For a given nonnegative integer n,
# find the smallest nonnegative cube that contains it as a substring.
NUM_TERMS = 30
(0...NUM_TERMS).each{ |i|
  (0..(1.0/0.0)).each{ |j|
    (print "#{j*j*j}" + ", "; break) if "#{j*j*j}".include?("#{i}")
  }
}

Edited by Alois P. Heinz, Jan 02 2011

cp's OEIS Frontend

A029946 a(n)^3 contains n-th prime as a substring.

Views

Author

Keywords

Links

Crossrefs

Programs

Mathematica