login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A175696 a(n) is the smallest number such that a(n)*n is an anagram of a(n) * 7. 1

%I #17 Jan 03 2021 00:28:07

%S 1359,774,45,3,279,693,1,315,18,15,261,18,495,17982,2475,37,189,3519,

%T 249,3861,3393,42,225,4113,37,22581,234,2826,2385,2439,165,1791,27,15,

%U 24975,17838,1668,2556,15129,1728,146655,198,14928,162081,146952,17829

%N a(n) is the smallest number such that a(n)*n is an anagram of a(n) * 7.

%C a(4) = 3 because 4*3=12, 7*3=21 and 12 is an anagram of 21.

%C From _Zak Seidov_, Aug 13 2010: (Start)

%C More terms: 18324, 167004, 15369, 14625, 14751, 1556, 17217, 150975, 15402, 16281, 144036, 156852, 161379, 152703, 14985, 146907, 1557, 154707, 1480356, 1471248, 1429851, 1435428, 143783856.

%C Apparently a(69) = 143783856 is the last term and the sequence is fini, full. (End)

%H Julio Alvarado, <a href="/A175696/b175696.txt">Table of n, a(n) for n = 1..69</a>

%t f[n_] := Block[ {k = 1}, While[ Sort@ IntegerDigits[7 k] != Sort@ IntegerDigits[k*n], k++ ]; k]; Array[f, 46] (* _Robert G. Wilson v_, Aug 15 2010 *)

%K base,nonn,fini,full

%O 1,1

%A _Claudio Meller_, Aug 09 2010

%E a(31)-a(68) from Zak Seidov, a(69) from _D. S. McNeil_. - _Zak Seidov_, Aug 13 2010

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 16 08:27 EDT 2024. Contains 371698 sequences. (Running on oeis4.)