A248353 -id:A248353 - cp's OEIS frontend

A006886 Kaprekar numbers: positive numbers n such that n = q+r and n^2 = q*10^m+r, for some m >= 1, q >= 0 and 0 <= r < 10^m, with n != 10^a, a >= 1.

1, 9, 45, 55, 99, 297, 703, 999, 2223, 2728, 4879, 4950, 5050, 5292, 7272, 7777, 9999, 17344, 22222, 38962, 77778, 82656, 95121, 99999, 142857, 148149, 181819, 187110, 208495, 318682, 329967, 351352, 356643, 390313, 461539, 466830, 499500, 500500, 533170

Offset: 1

Robert Munafo

4879 and 5292 are in this sequence but not in A053816.
Digital root is either 1 or 9. - Ezhilarasu Velayutham, Jul 27 2019
Named after the Indian recreational mathematician Dattatreya Ramchandra Kaprekar (1905-1986). - Amiram Eldar, Jun 19 2021
The term a(11) = 4879 is the first not in subsequence A053816. - M. F. Hasler, Mar 28 2025

			703 is a Kaprekar number because 703 = 494 + 209, 703^2 = 494209.

D. R. Kaprekar, On Kaprekar numbers, J. Rec. Math., Vol. 13 (1980-1981), pp. 81-82.
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
David Wells, The Penguin Dictionary of Curious and Interesting Numbers, Penguin Books, NY, 1986, p. 151.

Robert Gerbicz, Table of n, a(n) for n = 1..51514 [T. D. Noe computed terms 1 - 1019, Nov 10 2007; R. Gerbicz computed the first 51514 terms, Jul 28 2011]
Santanu Bandyopadhyay, Kaprekar Number, Indian Institute of Technology Bombay (Mumbai, India, 2020).
Nicholas John Bizzell-Browning, LIE scales: Composing with scales of linear intervallic expansion, Ph. D. Thesis, Brunel Univ. (UK, 2024). See p. 142.
Ömer Eğecioğlu and Bünyamin Şahin, On twin EP numbers, Transact. Comb. (2025) Vol. 14, Iss. 4, Art. No. 4, 261-270. See p. 262, also ResearchGate.
Shyam Sunder Gupta, On Some Marvellous Numbers of Kaprekar, Exploring the Beauty of Fascinating Numbers, Springer (2025) Ch. 9, 275-315.
Hans Havermann, The first 11 million Kaprekar numbers (plus the region around the billionth).
Douglas E. Iannucci, The Kaprekar Numbers, Journal of Integer Sequences, Vol. 3 (2000), Article 1.2,
Douglas E. Iannucci and Bertrum Foster, Kaprekar Triples, Journal of Integer Sequences, Vol. 8 (2005), Article 05.4.8.
Robert Munafo, Kaprekar Sequences.
Rosetta Code, Kaprekar numbers.
Walter Schneider, Kaprekar Numbers, 2002.
Gérard Villemin's Almanach of Numbers, Nombres de Kaprekar
Eric Weisstein's World of Mathematics, Kaprekar Number.
Wikipedia, Kaprekar number.
Index entries for Colombian or self numbers and related sequences

See A053816 for another version.
Cf. A037042, A053394, A053395, A053396, A053397, A045913, A003052.
Cf. A193992 (where 10^n-1 occurs in A006886), A194232 (first differences).
Subsequence of A248353.

-- See A194218 for another version
a006886 n = a006886_list !! (n-1)
a006886_list = 1 : filter chi [4..] where
   chi n = read (reverse us) + read (reverse vs) == n where
       (us,vs) = splitAt (length $ show n) (reverse $ show (n^2))
-- Reinhard Zumkeller, Aug 18 2011

(* This Mathematica code computes five additional powers in order to be sure that all the Kaprekar numbers have been computed. This fix works for mx <= 50, which includes terms computed by Gerbicz. *)
Inv[a_, b_] := PowerMod[a, -1, b]; mx = 20; t = {1}; Do[h = 10^k - 1; d = Divisors[h]; d2 = Select[d, GCD[#, h/#] == 1 &]; If[Log[10, h] < mx, AppendTo[t, h]]; Do[q = d2[[i]]*Inv[d2[[i]], h/d2[[i]]]; If[Log[10, q] < mx, AppendTo[t, q]], {i, 2, Length[d2] - 1}], {k, mx + 5}]; t = Union[t] (* T. D. Noe, Aug 17 2011, Aug 18 2011 *)
kaprQ[\[Nu]_] := Module[{n = \[Nu]^2},
  MemberQ[Plus @@ # & /@
    Select[Table[{Floor[n/10^j], 10^j*FractionalPart[n/10^j]}, {j,
       IntegerLength@n - 1}], #[[2]] != 0 &], \[Nu]]];
Select[Range@1000000, kaprQ] (* Hans Rudolf Widmer, Oct 22 2021 *)

select( {is_A006886(n)=my(N=n^2,m=1);while(N>m*=10,n==N%m+N\m && m!=n && return(m));n==1}, [1..10^5]) \\ M. F. Hasler, Mar 28 2025

def is_A006886(n):
    m=1; return (N:=n**2)and any(n==sum(divmod(N,m:=m*10))!=m for _ in str(N))
print(upto_1e5 := [n for n in range(10**5)if is_A006886(n)]) # M. F. Hasler, Mar 28 2025

a(n) = A194218(n) + A194219(n) and A194218(n) concatenated with A194219(n) gives a(n)^2. - Reinhard Zumkeller, Aug 19 2011

More terms from Michel ten Voorde, Apr 11 2001
4879 and 5292 added by Larry Reeves (larryr(AT)acm.org), Apr 24 2001
38962 added by Larry Reeves (larryr(AT)acm.org), May 23 2002

A102766 Numbers n that can be chopped into two parts, which when added and squared result in n.

Original entry on oeis.org

1, 81, 100, 2025, 3025, 9801, 10000, 88209, 494209, 998001, 1000000, 4941729, 7441984, 23804641, 24502500, 25502500, 28005264, 52881984, 60481729, 99980001, 100000000, 300814336, 493817284, 1518037444, 6049417284, 6832014336, 9048004641, 9999800001, 10000000000

Offset: 1

Bodo Zinser, Feb 10 2005

			a(7) = 88209 is a term as (88+209)^2 = 297^2 = 88209.

Michael S. Branicky, Table of n, a(n) for n = 1..131
Henry Ernest Dudeney, Amusements in Mathematics, 1917. See problem 113, "The torn number".

Supersequence of A238237.

from math import isqrt
from itertools import count, islice
def ok(n):
    if n == 1: return True
    r = isqrt(n)
    if r**2 != n: return False
    s = str(n)
    return any(int(s[:i])+int(s[i:])== r for i in range(1, len(s)))
def agen(): yield from (k**2 for k in count(1) if ok(k**2))
print(list(islice(agen(), 29))) # Michael S. Branicky, Dec 29 2024

a(n) = A248353(n)^2.

a(1)=1 prepended by Max Alekseyev, Aug 04 2017

a(27) and beyond from Michael S. Branicky, Dec 29 2024

A045913 Kaprekar numbers: numbers k such that k = q + r and k^2 = q*10^m + r, for some m >= 1, q >= 0 and 0 <= r < 10^m. Here q and r must both have the same number of digits.

Original entry on oeis.org

1, 9, 45, 55, 703, 4950, 5050, 7272, 7777, 77778, 82656, 318682, 329967, 351352, 356643, 390313, 461539, 466830, 499500, 500500, 533170, 538461, 609687, 643357, 648648, 670033, 681318, 791505, 812890, 818181, 851851, 857143, 4444444, 4927941, 5072059, 5555556, 11111112, 36363636, 38883889, 44363341, 44525548, 49995000, 50005000

Offset: 1

N. J. A. Sloane

A variant of Kaprekar's original definition (A006886).

			703 is Kaprekar because 703 = 494 + 209, 703^2 = 494209.
11111112^2 = 123456809876544 = (1234568 + 9876544)^2. The two "halves" of the square have the same length here, although it's not m but rather m - 1.

D. R. Kaprekar, On Kaprekar numbers, J. Rec. Math., 13 (1980-1981), 81-82.
D. Wells, The Penguin Dictionary of Curious and Interesting Numbers, Penguin Books, NY, 1986, p. 151.

Jinyuan Wang, Table of n, a(n) for n = 1..30047
D. E. Iannucci, The Kaprekar numbers, J. Integer Sequences, Vol. 3, 2000, #1.2.
Rosetta Code, Kaprekar numbers
Eric Weisstein's World of Mathematics, Kaprekar Number
Wikipedia, Kaprekar number
Index entries for Colombian or self numbers and related sequences

Cf. A006886, A037042, A053394, A053395, A053396, A053397, A003052, A248353.

More terms from Michel ten Voorde, Apr 13 2001
Definition clarified by Reinhard Zumkeller, Oct 05 2014
Definition modified and terms corrected by Max Alekseyev, Aug 06 2017

A328173 Numbers k such that decimal expansion of k^2 can be split into two parts whose sum is a number with repeated digits.

Original entry on oeis.org

4, 5, 6, 9, 10, 11, 20, 22, 30, 33, 44, 55, 57, 66, 77, 99, 100, 111, 159, 171, 200, 222, 300, 333, 444, 555, 666, 704, 889, 999, 1000, 1111, 1149, 1578, 1755, 2000, 2025, 2222, 2618, 3000, 3111, 3333, 6666, 7777, 9999, 10000, 11111, 20000, 22222, 22568, 22972, 30000, 30297, 33333

Offset: 1

Seiichi Manyama, Oct 06 2019

			   4^2 =   16,   1 +  6 =   7.
   5^2 =   25,   2 +  5 =   7.
   6^2 =   36,   3 +  6 =   9.
   9^2 =   81,   8 +  1 =   9.
  10^2 =  100,   1 +  0 =   1.
  11^2 =  121,   1 + 21 =  22.
  20^2 =  400,   4 +  0 =   4.
  22^2 =  484,   4 + 84 =  88.
  30^2 =  900,   9 +  0 =   9.
  33^2 = 1089,  10 + 89 =  99.
  44^2 = 1936,  19 + 36 =  55.
  55^2 = 3025,  30 + 25 =  55.
  57^2 = 3249, 324 +  9 = 333.
  66^2 = 4356,  43 + 56 =  99.
  77^2 = 5929,  59 + 29 =  88.
  99^2 = 9801,  98 +  1 =  99.

Seiichi Manyama, Table of n, a(n) for n = 1..127

Cf. A000290, A010785, A248353.

def A(str)
  (0..str.size - 2).any?{|i| (str[0..i].to_i + str[i + 1..-1].to_i).to_s.split('').uniq.size == 1}
end
p (0..10 ** 4).select{|i| A((i * i).to_s)}

cp's OEIS Frontend

A006886 Kaprekar numbers: positive numbers n such that n = q+r and n^2 = q*10^m+r, for some m >= 1, q >= 0 and 0 <= r < 10^m, with n != 10^a, a >= 1.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Haskell

Mathematica

PARI

Python

Formula

Extensions

A102766 Numbers n that can be chopped into two parts, which when added and squared result in n.

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Python

Formula

Extensions

A045913 Kaprekar numbers: numbers k such that k = q + r and k^2 = q*10^m + r, for some m >= 1, q >= 0 and 0 <= r < 10^m. Here q and r must both have the same number of digits.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Extensions

A328173 Numbers k such that decimal expansion of k^2 can be split into two parts whose sum is a number with repeated digits.

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Ruby