Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A089697
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A089697 Smallest n-digit number k such that k+1 as well as the product of digits of k + 1 are squares greater than 1. +0
2
3, 24, 168, 1443, 12543, 118335, 1223235, 11323224, 111218115, 1112622735, 11127718143, 111234256323, 1111183732128, 11112128912195, 111121198291215, 1111117422231183, 11111117364211224, 111111275555616399, 1111251521961995715, 11111411997592513155 (list; graph; listen)
OFFSET

1,1

MAPLE

readlib(issqr): Digits:=100: for d from 1 to 20 do for n from ceil(sqrt((10^d-1)/9+1)) to floor(sqrt(10^d)) do m:=mul(j, j=convert(n^2-1, base, 10)): if m<>0 and issqr(m+1) then printf("%d, ", n^2-1): break fi od od: (C. Ronaldo)

CROSSREFS

Cf. A081990, A089698.

Sequence in context: A094432 A104527 A058038 this_sequence A120741 A073985 A144087

Adjacent sequences: A089694 A089695 A089696 this_sequence A089698 A089699 A089700

KEYWORD

base,nonn

AUTHOR

Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Nov 10 2003

EXTENSIONS

More terms from C. Ronaldo (aga_new_ac(AT)hotmail.com), Dec 25 2004

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 9 14:43 EST 2009. Contains 170430 sequences.


AT&T Labs Research