A272826 -id:A272826 - cp's OEIS frontend

A272827 Fibonacci numbers whose digits are powers of 2.

1, 2, 8, 21, 144, 4181

Offset: 1

Waldemar Puszkarz, May 07 2016

Intersection of A028846 and A000045.
Cubes 1 and 8 are also members of A272826.
a(7), if it exists, is greater than Fibonacci(10^7). - Lars Blomberg, Aug 17 2016

			144 is a term as its digits are only powers of 2 and it is a Fibonacci number (see A000045).

Cf. A000045 (Fibonacci numbers), A028846 (numbers whose digits are powers of 2), A272826 (related sequence).

Select[Fibonacci@Range[2,50000], SubsetQ[{1,2,4,8}, IntegerDigits@#]&]

A272884 Squares whose digits are powers of 2.

Original entry on oeis.org

1, 4, 81, 121, 144, 441, 484, 841, 1444, 8281, 11881, 14884, 28224, 48841, 114244, 128881, 142884, 221841, 228484, 848241, 1121481, 1281424, 1418481, 2184484, 2214144, 8282884, 11142244, 11282881, 18241441, 18818244, 18844281, 21242881, 21818241, 28281124, 82428241, 121242121, 121484484, 124121881

Offset: 1

Waldemar Puszkarz, May 08 2016

Intersection of A000290 and A028846.
Note that in contrast to this sequence, which contains 102 terms up to 10^12, the analogous sequence of cubes (A272826) may contain only 3 in total.
Moreover, the similar sequences for the fourth and fifth perfect powers seem to contain only two terms (1, 81) in the case of the former and only one term (1) in the case of the latter. Higher powers also appear to produce sequences with one (mostly) or two terms only.
Unlike the analogous sequence for cubes, this sequence is heuristically infinite. - Charles R Greathouse IV, May 08 2016
This sequence is infinite because it contains the squares of the numbers of the forms 10*(10^k-1)/3+8 and 100*(10^k-1)/3+59. - Giovanni Resta, May 09 2016
Additionally, this sequence contains the squares of the numbers of the form 1000*(10^k-1)/3 + 809 for k > 2. For k > 2, numbers of the form (1000*(10^k-1)/3 + 809)^2 contains all digits that are powers of 2. - Altug Alkan, May 14 2016

			144 is a term as its digits are only powers of 2 and it is a square, 144 = 12^2.

Giovanni Resta, Table of n, a(n) for n = 1..10000

Cf. A000290 (squares), A028846 (numbers whose digits are powers of 2), A272826 (similar sequence for cubes).

Select[Range[12000]^2, SubsetQ[{1, 2, 4, 8}, IntegerDigits@#] &]
Select[Flatten[Table[FromDigits/@Tuples[{1,2,4,8},n],{n,9}]],IntegerQ[Sqrt[#]]&] (* Harvey P. Dale, Aug 05 2024 *)

is(n)=issquare(n) && #setintersect(Set(digits(n)), [0,3,5,6,7,9])==0 \\ Charles R Greathouse IV, May 08 2016

cp's OEIS Frontend

A272827 Fibonacci numbers whose digits are powers of 2.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica